A Commentary on the Collision of Worlds

Visit talk page

Allender's Conjecture and its Impacts on Meta-Complexity

Visit talk page

NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach

Visit talk page

Improved Learning from Time-bounded Kolmogorov Complexity

Visit talk page

Journey with Eric Allender: From Turing Machines to Circuits, and Back

Visit talk page

How to Cheat at “Who Wants to Be a Millionaire?” (and Show Non-Hardness of GapMCSP)

Visit talk page

The Mystery of the Missing String

Visit talk page

A Combinatorial Characterization of Minimax in 0/1 Games

Visit talk page

Replicability in Learning

Visit talk page

Range Avoidance, Remote Point, and Hard Partial Truth Table via Satisfying-Pairs Algorithms

Visit talk page