- Nisan-Wigderson generators in proof systems with forms of interpolation.Ján Pich - 2011 - Mathematical Logic Quarterly 57 (4):379-383.details
|
|
Dual weak pigeonhole principle, pseudo-surjective functions, and provability of circuit lower bounds.Jan Krajíček - 2004 - Journal of Symbolic Logic 69 (1):265-286.details
|
|
(1 other version)Tautologies from pseudo-random generators.Jan Krajíček - 2001 - Bulletin of Symbolic Logic 7 (2):197-212.details
|
|
Dual weak pigeonhole principle, pseudo-surjective functions, and provability of circuit lower bounds.Jan Kraj�?Ek - 2004 - Journal of Symbolic Logic 69 (1):265-286.details
|
|
The Intrinsic Computational Difficulty of Functions.Alan Cobham - 1965 - In Yehoshua Bar-Hillel (ed.), Logic, methodology and philosophy of science. Amsterdam,: North-Holland Pub. Co.. pp. 24-30.details
|
|
Dual weak pigeonhole principle, Boolean complexity, and derandomization.Emil Jeřábek - 2004 - Annals of Pure and Applied Logic 129 (1-3):1-37.details
|
|
The relative efficiency of propositional proof systems.Stephen A. Cook & Robert A. Reckhow - 1979 - Journal of Symbolic Logic 44 (1):36-50.details
|
|
(1 other version)Tautologies From Pseudo-random Generators, By, Pages 197 -- 212.Jan Krajíček - 2001 - Bulletin of Symbolic Logic 7 (2):197-212.details
|
|
Bounded arithmetic and the polynomial hierarchy.Jan Krajíček, Pavel Pudlák & Gaisi Takeuti - 1991 - Annals of Pure and Applied Logic 52 (1-2):143-153.details
|
|
Propositional proof systems, the consistency of first order theories and the complexity of computations.Jan Krajíček & Pavel Pudlák - 1989 - Journal of Symbolic Logic 54 (3):1063-1079.details
|
|
Logical foundations of proof complexity.Stephen Cook & Phuong Nguyen - 2011 - Bulletin of Symbolic Logic 17 (3):462-464.details
|
|