On convex complexity measures
Hrubeš, P., Jukna, S., Kulikov, A., Pudlák, P.
Published in Theoretical computer science (28.03.2010)
Published in Theoretical computer science (28.03.2010)
Get full text
Journal Article
The Complexity of Proving That a Graph Is Ramsey
Lauria, Massimo, Pudlák, Pavel, Rödl, Vojtěch, Thapen, Neil
Published in Automata, Languages, and Programming (2013)
Published in Automata, Languages, and Programming (2013)
Get full text
Book Chapter
Conference Proceeding
Bounded arithmetic and the polynomial hierarchy
Krajíček, Jan, Pudlák, Pavel, Takeuti, Gaisi
Published in Annals of pure and applied logic (15.04.1991)
Published in Annals of pure and applied logic (15.04.1991)
Get full text
Journal Article
Tight Bounds on Computing Error-Correcting Codes by Bounded-Depth Circuits With Arbitrary Gates
Gal, Anna, Hansen, Kristoffer Arnsfelt, Koucky, Michal, Pudlak, Pavel, Viola, Emanuele
Published in IEEE transactions on information theory (01.10.2013)
Published in IEEE transactions on information theory (01.10.2013)
Get full text
Journal Article
Conference Proceeding
Monotone simulations of nonmonotone proofs
Atserias, A., Galesi, N., Pudlak, P.
Published in Proceedings 16th Annual IEEE Conference on Computational Complexity (2001)
Published in Proceedings 16th Annual IEEE Conference on Computational Complexity (2001)
Get full text
Conference Proceeding
On reducibility and symmetry of disjoint NP pairs
Get full text
Journal Article
Conference Proceeding
Lower bounds to the complexity of symmetric Boolean functions
Babai, L., Pudlák, P., Rödl, V., Szemeredi, E.
Published in Theoretical computer science (28.08.1990)
Published in Theoretical computer science (28.08.1990)
Get full text
Journal Article