Pavel Pudlák

169 papers A* 20A 9B 13C 1Misc 2Journal 110Unranked 8
YearRankTypeTitle / Venue / Authors
2026 J jnl
Colorings of k-sets with low discrepancy on small sets.
J. Comb. Theory B
Pavel Pudlák, Vojtech Rödl
2024 A conf
Local Enumeration and Majority Lower Bounds.
CCC
Mohit Gurumukhani, Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Navid Talebanfard
2024 J jnl
Local Enumeration and Majority Lower Bounds.
CoRR
Mohit Gurumukhani, Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Navid Talebanfard
2024 J jnl
On the Ramsey numbers of daisies I.
Comb. Probab. Comput.
Pavel Pudlák, Vojtech Rödl, Marcelo Tadeu Sales
2023 B conf
Bounds on Functionality and Symmetric Difference - Two Intriguing Graph Parameters.
WG
Pavel Dvorák, Lukás Folwarczný, Michal Opler, Pavel Pudlák, Robert Sámal, Tung Anh Vu
2023 J jnl
Bounds on Functionality and Symmetric Difference - Two Intriguing Graph Parameters.
CoRR
Pavel Dvorák, Lukás Folwarczný, Michal Opler, Pavel Pudlák, Robert Sámal, Tung Anh Vu
2023 J jnl
Reviews.
Bull. Symb. Log.
Pavel Pudlák
2022 J jnl
Extractors for Small Zero-Fixing Sources.
Comb.
Pavel Pudlák, Vojtech Rödl
2022 A conf
Linear Branching Programs and Directional Affine Extractors.
CCC
Svyatoslav Gryaznov, Pavel Pudlák, Navid Talebanfard
2022 J jnl
Linear Branching Programs and Directional Affine Extractors.
CoRR
Svyatoslav Gryaznov, Pavel Pudlák, Navid Talebanfard
2022 J jnl
On matrices potentially useful for tree codes.
Inf. Process. Lett.
Pavel Pudlák
2021 J jnl
The canonical pairs of bounded depth Frege systems.
Ann. Pure Appl. Log.
Pavel Pudlák
2020 J jnl
On matrices potentially useful for tree codes.
CoRR
Pavel Pudlák
2020 J jnl
Santha-Vazirani sources, deterministic condensers and very strong extractors.
Theory Comput. Syst.
Dmitry Gavinsky, Pavel Pudlák
2019 J jnl
Extractors for small zero-fixing sources.
CoRR
Pavel Pudlák, Vojtech Rödl
2019 J jnl
Extractors for small zero-fixing sources.
Electron. Colloquium Comput. Complex.
Pavel Pudlák, Vojtech Rödl
2019 J jnl
Random resolution refutations.
Comput. Complex.
Pavel Pudlák, Neil Thapen
2019 J jnl
Representations of Monotone Boolean Functions by Linear Programs.
ACM Trans. Comput. Theory
Mateus de Oliveira Oliveira, Pavel Pudlák
2019 J jnl
Santha-Vazirani sources, deterministic condensers and very strong extractors.
CoRR
Dmitry Gavinsky, Pavel Pudlák
2019 J jnl
The canonical pairs of bounded depth Frege systems.
CoRR
Pavel Pudlák
2018 J jnl
A note on monotone real circuits.
Inf. Process. Lett.
Pavel Hrubes, Pavel Pudlák
2018 A* conf
Beating Brute Force for (Quantified) Satisfiability of Circuits of Bounded Treewidth.
SODA
Daniel Lokshtanov, Ivan Mikhailin, Ramamohan Paturi, Pavel Pudlák
2018 J jnl
Proof Complexity (Dagstuhl Seminar 18051).
Dagstuhl Reports
Albert Atserias, Jakob Nordström, Pavel Pudlák, Rahul Santhanam
2017 J jnl
A note on monotone real circuits.
Electron. Colloquium Comput. Complex.
Pavel Hrubes, Pavel Pudlák
2017 J jnl
A wild model of linear arithmetic and discretely ordered modules.
Math. Log. Q.
Petr Glivický, Pavel Pudlák
2017 J jnl
Incompleteness in the finite Domain.
Bull. Symb. Log.
Pavel Pudlák
2017 J jnl
Partition Expanders.
Theory Comput. Syst.
Dmitry Gavinsky, Pavel Pudlák
2017 J jnl
Petr Hajek, 1940-2016.
Bull. EATCS
Pavel Pudlák
2017 A* conf
Random Formulas, Monotone Circuits, and Interpolation.
FOCS
Pavel Hrubes, Pavel Pudlák
2017 A conf
Random Resolution Refutations.
CCC
Pavel Pudlák, Neil Thapen
2017 J jnl
Random formulas, monotone circuits, and interpolation.
Electron. Colloquium Comput. Complex.
Pavel Hrubes, Pavel Pudlák
2017 A conf
Representations of Monotone Boolean Functions by Linear Programs.
CCC
Mateus de Oliveira Oliveira, Pavel Pudlák
2017 J jnl
Representations of Monotone Boolean Functions by Linear Programs.
Electron. Colloquium Comput. Complex.
Mateus de Oliveira Oliveira, Pavel Pudlák
2017 J jnl
The complexity of proving that a graph is Ramsey.
Comb.
Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen
2017 A* conf
Tighter Hard Instances for PPSZ.
ICALP
Pavel Pudlák, Dominik Scheder, Navid Talebanfard
2016 — ch.
Backtracking Based
Encyclopedia of Algorithms
Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Francis Zane
2016 J jnl
Random resolution refutations.
Electron. Colloquium Comput. Complex.
Pavel Pudlák, Neil Thapen
2016 J jnl
Tighter Hard Instances for PPSZ.
CoRR
Pavel Pudlák, Dominik Scheder, Navid Talebanfard
2015 J jnl
On the Entropy of Locally-Independent Bernoulli Trials.
CoRR
Dmitry Gavinsky, Pavel Pudlák
2015 J jnl
On the complexity of finding falsifying assignments for Herbrand disjunctions.
Arch. Math. Log.
Pavel Pudlák
2015 A conf
The Space Complexity of Cutting Planes Refutations.
CCC
Nicola Galesi, Pavel Pudlák, Neil Thapen
2014 J jnl
On the complexity of finding falsifying assignments for Herbrand disjunctions.
CoRR
Pavel Pudlák
2014 J jnl
Parity Games and Propositional Proofs.
ACM Trans. Comput. Log.
Arnold Beckmann, Pavel Pudlák, Neil Thapen
2014 A conf
Partition Expanders.
STACS
Dmitry Gavinsky, Pavel Pudlák
2014 J jnl
Partition Expanders.
CoRR
Dmitry Gavinsky, Pavel Pudlák
2014 J jnl
Partition Expanders.
Electron. Colloquium Comput. Complex.
Dmitry Gavinsky, Pavel Pudlák
2014 J jnl
The space complexity of cutting planes refutations.
Electron. Colloquium Comput. Complex.
Nicola Galesi, Pavel Pudlák, Neil Thapen
2013 — ch.
An Upper Bound for a Communication Game Related to Time-Space Tradeoffs.
The Mathematics of Paul Erdős I
Pavel Pudlák, Jirí Sgall
2013 J jnl
Linear tree codes and the problem of explicit constructions.
CoRR
Pavel Pudlák
2013 — book
Logical Foundations of Mathematics and Computational Complexity - A Gentle Introduction.
Pavel Pudlák
2013 B conf
Parity Games and Propositional Proofs.
MFCS
Arnold Beckmann, Pavel Pudlák, Neil Thapen
2013 J jnl
Parity Games and Propositional Proofs.
Electron. Colloquium Comput. Complex.
Pavel Pudlák, Arnold Beckmann, Neil Thapen
2013 — conf
The Complexity of Proving That a Graph Is Ramsey.
ICALP (1)
Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen
2013 J jnl
The complexity of proving that a graph is Ramsey
CoRR
Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen
2013 J jnl
The complexity of proving that a graph is Ramsey.
Electron. Colloquium Comput. Complex.
Massimo Lauria, Pavel Pudlák, Vojtech Rödl, Neil Thapen
2013 J jnl
Tight Bounds on Computing Error-Correcting Codes by Bounded-Depth Circuits With Arbitrary Gates.
IEEE Trans. Inf. Theory
Anna Gál, Kristoffer Arnsfelt Hansen, Michal Koucký, Pavel Pudlák, Emanuele Viola
2012 J jnl
A lower bound on the size of resolution proofs of the Ramsey theorem.
Inf. Process. Lett.
Pavel Pudlák
2012 J jnl
Alternating minima and maxima, Nash equilibria and Bounded Arithmetic.
Ann. Pure Appl. Log.
Pavel Pudlák, Neil Thapen
2012 A* conf
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates.
STOC
Anna Gál, Kristoffer Arnsfelt Hansen, Michal Koucký, Pavel Pudlák, Emanuele Viola
2011 J jnl
A lower bound on the size of resolution proofs of the Ramsey theorem.
Electron. Colloquium Comput. Complex.
Pavel Pudlák
2011 A* conf
Pseudorandom generators for group products: extended abstract.
STOC
Michal Koucký, Prajakta Nimbhorkar, Pavel Pudlák
2011 J jnl
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates.
Electron. Colloquium Comput. Complex.
Anna Gál, Kristoffer Arnsfelt Hansen, Michal Koucký, Pavel Pudlák, Emanuele Viola
2010 J jnl
On convex complexity measures.
Theor. Comput. Sci.
Pavel Hrubes, Stasys Jukna, Alexander S. Kulikov, Pavel Pudlák
2010 — conf
On extracting computations from propositional proofs (a survey).
FSTTCS
Pavel Pudlák
2010 A* conf
On the complexity of circuit satisfiability.
STOC
Ramamohan Paturi, Pavel Pudlák
2010 J jnl
Pseudorandom Generators for Group Products.
Electron. Colloquium Comput. Complex.
Michal Koucký, Prajakta Nimbhorkar, Pavel Pudlák
2010 J jnl
Some constructive bounds on Ramsey numbers.
J. Comb. Theory B
Alexandr V. Kostochka, Pavel Pudlák, Vojtech Rödl
2009 J jnl
On convex complexity measures.
Electron. Colloquium Comput. Complex.
Pavel Hrubes, Stasys Jukna, Alexander S. Kulikov, Pavel Pudlák
2009 J jnl
Quantum deduction rules.
Ann. Pure Appl. Log.
Pavel Pudlák
2008 — ch.
Backtracking Based k-SAT Algorithms.
Encyclopedia of Algorithms
Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Francis Zane
2008 A conf
Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity.
CCC
Dmitry Gavinsky, Pavel Pudlák
2008 J jnl
Fragments of bounded arithmetic and the lengths of proofs.
J. Symb. Log.
Pavel Pudlák
2008 Misc conf
Twelve Problems in Proof Complexity.
CSR
Pavel Pudlák
2007 J jnl
Exponential Separation of Quantum and Classical Non-Interactive Multi-Party Communication Complexity.
Electron. Colloquium Comput. Complex.
Dmitry Gavinsky, Pavel Pudlák
2007 J jnl
Quantum deduction rules.
Electron. Colloquium Comput. Complex.
Pavel Pudlák
2006 — conf
06111 Abstracts Collection -- Complexity of Boolean Functions.
Complexity of Boolean Functions
Matthias Krause, Pavel Pudlák, Rüdiger Reischuk, Dieter van Melkebeek
2006 — conf
06111 Executive Summary -- Complexity of Boolean Functions.
Complexity of Boolean Functions
Matthias Krause, Dieter van Melkebeek, Pavel Pudlák, Rüdiger Reischuk
2006 — ed.
Complexity of Boolean Functions, 12.03. - 17.03.2006
Complexity of Boolean Functions
Matthias Krause, Pavel Pudlák, Rüdiger Reischuk, Dieter van Melkebeek
2006 A conf
Godel and Computations (Abstract).
CCC
Pavel Pudlák
2006 J jnl
Gödel and computations: a 100th anniversary retrospective.
SIGACT News
Pavel Pudlák
2006 A* conf
Lower bounds for circuits with MOD_m gates.
FOCS
Arkadev Chattopadhyay, Navin Goyal, Pavel Pudlák, Denis Thérien
2006 C conf
On Search Problems in Complexity Theory and in Logic (Abstract).
CIAC
Pavel Pudlák
2005 J jnl
A nonlinear bound on the number of wires in bounded depth circuits
Electron. Colloquium Comput. Complex.
Pavel Pudlák
2005 J jnl
An improved exponential-time algorithm for
J. ACM
Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Francis Zane
2005 A* conf
Bounded-depth circuits: separating wires from gates.
STOC
Michal Koucký, Pavel Pudlák, Denis Thérien
2004 J jnl
Circuit lower bounds and linear codes
Electron. Colloquium Comput. Complex.
Ramamohan Paturi, Pavel Pudlák
2003 J jnl
A note on monotone complexity and the rank of matrices.
Inf. Process. Lett.
Anna Gál, Pavel Pudlák
2003 J jnl
An Application of Hindman's Theorem to a Problem on Communication Complexity.
Comb. Probab. Comput.
Pavel Pudlák
2003 J jnl
Erratum to: "A note on monotone complexity and the rank of matrices": [Information Processing Letters 87 (2003) 321-326].
Inf. Process. Lett.
Anna Gál, Pavel Pudlák
2003 J jnl
On reducibility and symmetry of disjoint NP pairs.
Theor. Comput. Sci.
Pavel Pudlák
2003 J jnl
Parallel strategies.
J. Symb. Log.
Pavel Pudlák
2002 J jnl
Cycles of Nonzero Elements in Low Rank Matrices.
Comb.
Pavel Pudlák
2002 J jnl
Monotone complexity and the rank of matrices
Electron. Colloquium Comput. Complex.
Pavel Pudlák
2002 J jnl
Monotone simulations of non-monotone proofs.
J. Comput. Syst. Sci.
Albert Atserias, Nicola Galesi, Pavel Pudlák
2001 J jnl
Complexity Theory and Genetics: The Computational Power of Crossing Over.
Inf. Comput.
Pavel Pudlák
2001 J jnl
Gust Editor's Foreword.
J. Comput. Syst. Sci.
Pavel Pudlák
2001 A conf
Monotone Simulations of Nonmonotone Proofs.
CCC
Albert Atserias, Nicola Galesi, Pavel Pudlák
2001 B conf
On Reducibility and Symmetry of Disjoint NP-Pairs.
MFCS
Pavel Pudlák
2001 J jnl
On reducibility and symmetry of disjoint NP-pairs
Electron. Colloquium Comput. Complex.
Pavel Pudlák
2001 J jnl
On the computational content of intuitionistic propositional proofs.
Ann. Pure Appl. Log.
Samuel R. Buss, Pavel Pudlák
2000 A* conf
A lower bound for DLL algorithms for
SODA
Pavel Pudlák, Russell Impagliazzo
2000 J jnl
A note on the use of determinant for proving lower bounds on the size of linear circuits.
Inf. Process. Lett.
Pavel Pudlák
2000 J jnl
Monotone simulations of nonmonotone propositional proofs
Electron. Colloquium Comput. Complex.
Albert Atserias, Nicola Galesi, Pavel Pudlák
2000 J jnl
Proofs as Games.
Am. Math. Mon.
Pavel Pudlák
2000 J jnl
Some structural properties of low-rank matrices related to computational complexity.
Theor. Comput. Sci.
Bruno Codenotti, Pavel Pudlák, Giovanni Resta
1999 J jnl
A Note on Applicability of the Incompleteness Theorem to Human Mind.
Ann. Pure Appl. Log.
Pavel Pudlák
1999 J jnl
Lower Bounds for the Polynomial Calculus and the Gröbner Basis Algorithm.
Comput. Complex.
Russell Impagliazzo, Pavel Pudlák, Jirí Sgall
1999 J jnl
Satisfiability Coding Lemma.
Chic. J. Theor. Comput. Sci.
Ramamohan Paturi, Pavel Pudlák, Francis Zane
1998 J jnl
A Note On the Use of Determinant for Proving Lower Bounds on the Size of Linear Circuits
Electron. Colloquium Comput. Complex.
Pavel Pudlák
1998 A* conf
An Improved Exponential-Time Algorithm for
FOCS
Ramamohan Paturi, Pavel Pudlák, Michael E. Saks, Francis Zane
1998 J jnl
Computing Boolean Functions by Polynomials and Threshold Circuits.
Comput. Complex.
Matthias Krause, Pavel Pudlák
1998 B conf
Satisfiability - Algorithms and Logic.
MFCS
Pavel Pudlák
1998 J jnl
Some Consequences of Cryptographical Conjectures for S
Inf. Comput.
Jan Krajícek, Pavel Pudlák
1997 J jnl
Boolean Circuits, Tensor Ranks, and Communication Complexity.
SIAM J. Comput.
Pavel Pudlák, Vojtech Rödl, Jirí Sgall
1997 J jnl
Lower Bounds for Resolution and Cutting Plane Proofs and Monotone Computations.
J. Symb. Log.
Pavel Pudlák
1997 J jnl
Lower Bounds for the Polynomial Calculus and the Groebner Basis Algorithm
Electron. Colloquium Comput. Complex.
Russell Impagliazzo, Pavel Pudlák, Jirí Sgall
1997 J jnl
On Sparse Parity Check Matrices.
Des. Codes Cryptogr.
Hanno Lefmann, Pavel Pudlák, Petr Savický
1997 J jnl
On the Computational Power of Depth-2 Circuits with Threshold and Modulo Gates.
Theor. Comput. Sci.
Matthias Krause, Pavel Pudlák
1997 J jnl
Proof Complexity in Algebraic Systems and Bounded Depth Frege Systems with Modular Counting.
Comput. Complex.
Samuel R. Buss, Russell Impagliazzo, Jan Krajícek, Pavel Pudlák, Alexander A. Razborov, Jirí Sgall
1997 A* conf
Satisfiability Coding Lemma.
FOCS
Ramamohan Paturi, Pavel Pudlák, Francis Zane
1997 J jnl
Some structural properties of low rank matrices related to computational complexity
Electron. Colloquium Comput. Complex.
Bruno Codenotti, Pavel Pudlák, Giovanni Resta
1996 — conf
Algebraic models of computation and interpolation for algebraic proof systems.
Proof Complexity and Feasible Arithmetics
Pavel Pudlák, Jirí Sgall
1996 Misc conf
On Sparse Parity Chack Matrices (Extended Abstract).
COCOON
Hanno Lefmann, Pavel Pudlák, Petr Savický
1995 J jnl
An Exponenetioal Lower Bound to the Size of Bounded Depth Frege Proofs of the Pigeonhole Principle.
Random Struct. Algorithms
Jan Krajícek, Pavel Pudlák, Alan R. Woods
1995 J jnl
An Upper Bound for a Communication Game Related to Time-Space Tradeoffs
Electron. Colloquium Comput. Complex.
Pavel Pudlák, Jirí Sgall
1995 A* conf
On Computing Boolean Functions by Sparse Real Polynomials.
FOCS
Matthias Krause, Pavel Pudlák
1995 J jnl
Top-Down Lower Bounds for Depth-Three Circuits.
Comput. Complex.
Johan Håstad, Stasys Jukna, Pavel Pudlák
1994 J jnl
An Exponential Lower Bound to the Size of Bounded Depth Frege Proofs of the Pigeonhole Principle
Electron. Colloquium Comput. Complex.
Jan Krajícek, Pavel Pudlák, Alan R. Woods
1994 J jnl
Communication in Bounded Depth Circuits.
Comb.
Pavel Pudlák
1994 J jnl
Complexity Theory and Genetics (extended abstract)
Electron. Colloquium Comput. Complex.
Pavel Pudlák
1994 — conf
Complexity Theory and Genetics.
SCT
Pavel Pudlák
1994 B conf
How to Lie Without Being (Easily) Convicted and the Length of Proofs in Propositional Calculus.
CSL
Pavel Pudlák, Samuel R. Buss
1994 A* conf
Lower Bound on Hilbert's Nullstellensatz and propositional proofs
FOCS
Paul Beame, Russell Impagliazzo, Jan Krajícek, Toniann Pitassi, Pavel Pudlák
1994 J jnl
On the Computational Power of Depth 2 Circuits with Threshold and Modulo Gates
Electron. Colloquium Comput. Complex.
Matthias Krause, Pavel Pudlák
1994 A* conf
On the computational power of depth 2 circuits with threshold and modulo gates.
STOC
Matthias Krause, Pavel Pudlák
1994 — conf
Some Consequences of Cryptographical Conjectures for S_2^1 and EF.
LCC
Jan Krajícek, Pavel Pudlák
1994 J jnl
Some combinatorial-algebraic problems from complexity theory.
Discret. Math.
Pavel Pudlák, Vojtech Rödl
1994 J jnl
Superconcentrators of Depths 2 and 3; Odd Levels Help (Rarely).
J. Comput. Syst. Sci.
Noga Alon, Pavel Pudlák
1994 A* conf
Unexpected Upper Bounds on the Complexity of Some Communication Games.
ICALP
Pavel Pudlák
1993 B conf
AC
FCT
Pavel Pudlák
1993 — book
Metamathematics of First-Order Arithmetic.
Petr Hájek, Pavel Pudlák
1993 A* conf
Modified ranks of tensors and the size of circuits.
STOC
Pavel Pudlák, Vojtech Rödl
1993 J jnl
On shifting networks.
Theor. Comput. Sci.
Pavel Pudlák, Petr Savický
1993 J jnl
Threshold Circuits of Bounded Depth.
J. Comput. Syst. Sci.
András Hajnal, Wolfgang Maass, Pavel Pudlák, Mario Szegedy, György Turán
1993 A* conf
Top-Down Lower Bounds for Depth 3 Circuits
FOCS
Johan Håstad, Stasys Jukna, Pavel Pudlák
1992 J jnl
A combinatorial approach to complexity.
Comb.
Pavel Pudlák, Vojtech Rödl
1992 A* conf
Exponential Lower Bounds for the Pigeonhole Principle
STOC
Paul Beame, Russell Impagliazzo, Jan Krajícek, Toniann Pitassi, Pavel Pudlák, Alan R. Woods
1991 J jnl
Bounded Arithmetic and the Polynomial Hierarchy.
Ann. Pure Appl. Log.
Jan Krajícek, Pavel Pudlák, Gaisi Takeuti
1990 B conf
Interactive Computations of Optimal Solutions.
MFCS
Jan Krajícek, Pavel Pudlák, Jirí Sgall
1990 J jnl
Lower Bounds to the Complexity of Symmetric Boolean Functions.
Theor. Comput. Sci.
László Babai, Pavel Pudlák, Vojtech Rödl, Endre Szemerédi
1990 J jnl
Quantified propositional calculi and fragments of bounded arithmetic.
Math. Log. Q.
Jan Krajícek, Pavel Pudlák
1990 B conf
Ramsey's Theorem in Bounded Arithmetic.
CSL
Pavel Pudlák
1989 B conf
On the Communication Complexity of Planarity.
FCT
Pavol Duris, Pavel Pudlák
1989 J jnl
On the structure of initial segments of models of arithmetic.
Arch. Math. Log.
Jan Krajícek, Pavel Pudlák
1989 J jnl
Propositional Proof Systems, the Consistency of First Order Theories and the Complexity of Computations.
J. Symb. Log.
Jan Krajícek, Pavel Pudlák
1989 B conf
Propositional Provability and Models of Weak Arithmetic.
CSL
Jan Krajícek, Pavel Pudlák
1988 J jnl
Graph Complexity.
Acta Informatica
Pavel Pudlák, Vojtech Rödl, Petr Savický
1988 J jnl
The number of proof lines and the size of proofs in first order logic.
Arch. Math. Log.
Jan Krajícek, Pavel Pudlák
1987 A* conf
Threshold circuits of bounded depth
FOCS
András Hajnal, Wolfgang Maass, Pavel Pudlák, Mario Szegedy, György Turán
1986 A* conf
Two lower bounds for branching programs
STOC
Miklós Ajtai, László Babai, Péter Hajnal, János Komlós, Pavel Pudlák, Vojtech Rödl, Endre Szemerédi, György Turán
1985 J jnl
Cuts, Consistency Statements and Interpretations.
J. Symb. Log.
Pavel Pudlák
1985 J jnl
Elementary Extensions of Models of the Alternative Set Theory.
Math. Log. Q.
Pavel Pudlák, Antonín Sochor
1984 B conf
A Lower Bound on Complexity of Branching Programs (Extended Abstract).
MFCS
Pavel Pudlák
1984 J jnl
Models of the Alternative Set Theory.
J. Symb. Log.
Pavel Pudlák, Antonín Sochor
1984 B conf
New Lower Bound for Polyhedral Membership Problem with an Application to Linear Programming.
MFCS
Jaroslav Morávek, Pavel Pudlák
1983 — conf
Bounds for Hodes-Specker theorem.
Logic and Machines
Pavel Pudlák
1982 J jnl
Partition theorems for systems of finite subsets of integers.
Discret. Math.
Pavel Pudlák, Vojtech Rödl
1979 J jnl
Complexity in Mechanized Hypothesis Formation.
Theor. Comput. Sci.
Pavel Pudlák, Frederick N. Springsteel
1975 B conf
Polynomially Complete Problems in the Logic of Automated Discovery.
MFCS
Pavel Pudlák