In the last 30+ years, several algorithms have been designed which crucially use randomness and beat their deterministic counterparts in terms of efficiency, simplicity and nearly every other ...

Example topics include logic and Boolean circuits; sets, functions, relations, databases, and finite automata; deterministic algorithms and randomized algorithms; analysis techniques based on counting ...