Author:
Chen Yijia,Flum Jörg,Müller Moritz
Funder
John Templeton Foundation
National Nature Science Foundation of China
Reference7 articles.
1. Logical Foundations of Proof Complexity;Cook,2010
2. Relations between diagonalization, proof systems, and complexity gaps;Hartmanis;Theoret. Comput. Sci.,1979
3. The fastest and shortest algorithm for all well-defined problems;Hutter;Internat. J. Found. Comput. Sci.,2002
4. Propositional proof systems, the consistency of first order theories and the complexity of computations;Krajíček;J. Symbolic Logic,1989
5. Universal search problems;Levin;Problemy Peredachi Informatsii,1973