Skip to content
sahil.science
Questions
Papers
Topics
Syntheses
Almanac
About
C⁶
2026
← Questions
Source-derived question
What does Yao's minimax theorem prove about randomised algorithms?
Computational Complexity Theory
Game Theory
Sources that address it
Turing Award
almanac
Related questions
How can a nondeterministic finite automaton be converted into a deterministic one without losing expressive power?
How did Cook's proof show that many seemingly unrelated hard computational problems were secretly versions of the same problem?
How did John Harsanyi extend Nash's framework to games of incomplete information?
How did Manuel Blum help define what it means for an encryption scheme to be secure?
How did Nash's schizophrenia affect the decades between his 1950 dissertation and his 1994 Nobel Prize?
How did Rabin and Scott's result seed later work on regular expressions and the P versus NP problem?
How did the Allais paradox contribute to the foundations of behavioural economics?
How did the classification of a problem as NP-complete change how computer scientists approach solving it?