- CHAPTER VIII TheLengthsofProofs
- Errata of Metamathematics of First-Order October 16, 2004
- Decorated Linear Order Types and the Theory of Concatenation
- Fragments of Bounded Arithmetic and the lengths of Pavel Pudlak #
- Satis ability { algorithms and logic (extended abstract)
- Alternating minima and maxima, Nash equilibria and Bounded Arithmetic
- Quantum deduction rules (preliminary version)
- Equilateral sets in l Noga Alon Pavel Pudl ak y
- Pseudorandom Generators for Group Products (version with the geometric proof --2nd draft)
- On Sparse Parity Check Matrices Hanno Lefmann \Lambda Pavel Pudl'ak y Petr Savick'y z
- Some constructive bounds on Ramsey numbers Alexandr Kostochka # , Pavel Pudlak + , and Vojtech Rodl #
- Pseudorandom sets and explicit constructions of Ramsey graphs
- Some structural properties of low rank matrices related to computational complexity
- On reducibility and symmetry of disjoint Pavel Pudl ak ?
- A note on applicability of the incompleteness theorem to human mind
- An Improved Exponentialtime Algorithm for kSAT Ramamohan Paturi Pavel Pudlak y Michael E. Saks z , Francis Zane x
- Does dominancerecessiveness have a survival value?
- Cycles of nonzero elements in low rank matrices Pavel Pudlak #
- Circuit lower bounds and linear codes Ramamohan Paturi Pavel Pudl ak y
- More on Computing Boolean Functions by Sparse Real Polynomials and related types
- A nice choice function in a countable model Pavel Pudl'ak
- How to lie without being (easily) convicted and the lengths of proofs in propositional calculus
- A nonlinear bound on the number of wires in bounded depth circuits
- Lower bounds for resolution and cutting plane proofs and monotone computations \Lambda
- On the lengths of proofs of consistency a survey of results
- On the Computational Power of Depth 2 Circuits with Threshold and Modulo Gates \Lambda
- Communication in Bounded Depth Circuits Pavel Pudl'ak
- An application of Hindman's theorem to a problem on communication complexity
- Consistency and games|in search of new combinatorial Pavel Pudl ak
- Boundeddepth Circuits: Separating Wires from Gates [Extended Abstract]
- Exponential Separation of Quantum and Classical NonInteractive MultiParty Communication Complexity
- A bottom-up approach to foundations of mathematics
- Twelve Problems in Proof Complexity Pavel Pudlak #
- Monotone Simulations of Nonmonotone Proofs Albert Atserias \Lambda
- On the computational content of intuitionistic propositional proofs
- On Convex Complexity Measures P. Hrubesa,1, S. Juknab,c,2, A. Kulikovd,3, P. Pudlake,,4
- On extracting computations from propositional proofs Pavel Pudlak
- LOGIC COLLOQUIUM '84 J.B. Paris, A.J. Wilkie. and G.M. Wiliners (Editors)
- Complexity theory and genetics, the computational power of crossing over
- Parallel strategies Pavel Pudl ak
- Proofs as games Pavel Pudl'ak \Lambda
- A lower bound for DLL algorithms for kSAT Pavel Pudl'ak \Lambda Russell Impagliazzo y
- Chicago Journal of Theoretical Computer Science
- Complexity theory and genetics, the computational power of crossing over
- Lower bounds for circuits with MODm gates Arkadev Chattopadhyay
- On the Complexity of Circuit Satisfiability (Extended Abstract)
- Superexponential computations in exponential Extended abstract of a lecture at JAF, Seville 11.6.2007
- On explicit Ramsey graphs and estimates of the number of sums and products
- Constructive lower bounds for offdiagonal Ramsey Noga Alon \Lambda Pavel Pudl'ak y
- Kreisel's Conjecture for L# 1 Matthias Baaz Pavel Pudlak
- On the complexity of the propositional calculus Pavel Pudl'ak \Lambda
- A note on monotone complexity and the rank of matrices
- November26,2011--12:02 Logical Foundations of Mathematics