Wrestling With Complexity Workshop
Wrestling with Complexity and the Five World Conundrum

The so-called five-worlds of complexity were introduced by Russell Impagliazzo (Fig. 1) to delineate five possible outcomes of the P versus NP problem, ranging from the possibility that P is equal to NP to the possibility that strong public-key cryptography is possible. Questions about which world we live in are of central importance to theoretical computer science. This workshop will address research into topics in computational complexity, cryptographic assumptions, randomness in computation, machine learning, complexity of proofs, and related topics that address issues raised by the five worlds conundrum.