Pavel Pudlák

发表

Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity

Dmitry Gavinsky, Pavel Pudlák, P. Pudlák, 2007, 2008 23rd Annual IEEE Conference on Computational Complexity.

Pavel Pudlák, 1993, FCT.

Logic Colloquium '98 : proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic, held in Prague, Czech Republic August 9-15, 1998

Samuel R. Buss, Petr Hájek, Pavel Pudlák, 2016 .

Random Resolution Refutations

Pavel Pudlák, Neil Thapen, 2016, Computational Complexity Conference.

A note on the use of determinant for proving lower bounds on the size of linear circuits

Pavel Pudlák, P. Pudlák, 2000, Inf. Process. Lett..

Threshold circuits of bounded depth

Pavel Pudlák, Wolfgang Maass, Mario Szegedy, 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

On the computational content of intuitionistic propositional proofs

Samuel R. Buss, Pavel Pudlák, 2001, Ann. Pure Appl. Log..

Backtracking Based k-SAT Algorithms

Michael E. Saks, Pavel Pudlák, Ramamohan Paturi, 2008, Encyclopedia of Algorithms.

On the lengths of proofs of consistency

Pavel Pudlák, P. Pudlák, 1996 .

On the structure of initial segments of models of arithmetic

Jan Krajícek, Pavel Pudlák, J. Krajícek, 1989, Arch. Math. Log..

Exponential Lower Bounds for the Pigeonhole Principle

Jan Krajícek, Russell Impagliazzo, Toniann Pitassi, 1992, STOC.

Pseudorandom Generators for Group Products

Pavel Pudlák, Michal Koucký, Prajakta Nimbhorkar, 2010, Electron. Colloquium Comput. Complex..

Representations of Monotone Boolean Functions by Linear Programs

Pavel Pudlák, Mateus de Oliveira Oliveira, 2019, ACM Trans. Comput. Theory.

Complexity of Boolean Functions, 12.03. - 17.03.2006

Dieter van Melkebeek, Pavel Pudlák, Rüdiger Reischuk, 2006, Complexity of Boolean Functions.

Modified ranks of tensors and the size of circuits

Vojtech Rödl, Pavel Pudlák, 1993, STOC '93.

On the Computational Power of Depth-2 Circuits with Threshold and Modulo Gates

Pavel Pudlák, Matthias Krause, 1997, Theor. Comput. Sci..

Santha-Vazirani sources, deterministic condensers and very strong extractors

Dmitry Gavinsky, Pavel Pudlák, 2020, Theory of Computing Systems.

Some Consequences of Cryptographical Conjectures for S_2^1 and EF

Jan Krajícek, Pavel Pudlák, 1994, LCC.

Representations of Monotone Boolean Functions by Linear Programs

Pavel Pudlák, Mateus de Oliveira Oliveira, P. Pudlák, 2019, CCC.

Random resolution refutations

Pavel Pudlák, Neil Thapen, 2019, computational complexity.

Monotone simulations of nonmonotone proofs

Pavel Pudlák, Albert Atserias, Nicola Galesi, 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.

On Sparse Parity Check Matrices

Hanno Lefmann, Pavel Pudlák, Petr Savický, 1997, Des. Codes Cryptogr..

A nonlinear bound on the number of wires in bounded depth circuits

Pavel Pudlák, 2005, Electron. Colloquium Comput. Complex..

Bounds for Hodes-Specker theorem

Pavel Pudlák, 1983, Logic and Machines.

The space complexity of cutting planes refutations

Pavel Pudlák, Neil Thapen, Nicola Galesi, 2014, Electron. Colloquium Comput. Complex..

Pseudorandom generators for group products: extended abstract

Pavel Pudlák, Michal Koucký, Prajakta Nimbhorkar, 2011, STOC '11.

Beating Brute Force for (Quantified) Satisfiability of Circuits of Bounded Treewidth

Pavel Pudlák, Daniel Lokshtanov, Ramamohan Paturi, 2018, SODA.

Consistency and games— in search of new combinatorial principles

Pavel Pudlák, Viggo Stoltenberg-Hansen, Jouko Väänänen, 2016 .

On the computational power of depth 2 circuits with threshold and modulo gates

Pavel Pudlák, Matthias Krause, 1994, STOC '94.

A combinatorial approach to complexity

Vojtech Rödl, Pavel Pudlák, V. Rödl, 1992, Comb..

Cuts, consistency statements and interpretations

Pavel Pudlák, P. Pudlák, 1985, Journal of Symbolic Logic.

Lower bounds for the polynomial calculus and the Gröbner basis algorithm

Russell Impagliazzo, Jirí Sgall, Pavel Pudlák, 1999, computational complexity.

Boolean Circuits, Tensor Ranks, and Communication Complexity

Vojtech Rödl, Jirí Sgall, Pavel Pudlák, 1997, SIAM J. Comput..

Gust Editor's Foreword

Pavel Pudlák, 2001, J. Comput. Syst. Sci..

Complexity in Mechanized Hypothesis Formation

Pavel Pudlák, Frederick N. Springsteel, 1979, Theor. Comput. Sci..

Godel and Computations (Abstract).

Pavel Pudlák, 2006 .

Language, Logic and Computations

Pavel Pudlák, P. Pudlák, 2013 .

Ramsey's Theorem in Bounded Arithmetic

Pavel Pudlák, P. Pudlák, 1990, CSL.

Tight Bounds on Computing Error-Correcting Codes by Bounded-Depth Circuits With Arbitrary Gates

Kristoffer Arnsfelt Hansen, Emanuele Viola, Pavel Pudlák, 2013, IEEE Trans. Inf. Theory.

A lower bound for DLL algorithms for k-SAT (preliminary version)

Russell Impagliazzo, Pavel Pudlák, R. Impagliazzo, 2000, SODA '00.

Propositional Provability and Models of Weak Arithmetic

Jan Krajícek, Pavel Pudlák, J. Krajícek, 1989, CSL.

Extractors for small zero-fixing sources

Vojtech Rödl, Pavel Pudlák, 2019, Electron. Colloquium Comput. Complex..

Some Consequences of Cryptographical Conjectures for S12 and EF

Jan Krajícek, Pavel Pudlák, J. Krajícek, 1998, Inf. Comput..

The complexity of proving that a graph is Ramsey

Vojtech Rödl, Pavel Pudlák, Neil Thapen, 2017, Comb..

On extracting computations from propositional proofs (a survey)

Pavel Pudlák, 2010, FSTTCS.

Some constructive bounds on Ramsey numbers

Vojtech Rödl, Alexandr V. Kostochka, Pavel Pudlák, 2010, J. Comb. Theory, Ser. B.

Parity Games and Propositional Proofs

Pavel Pudlák, Neil Thapen, Arnold Beckmann, 2013, MFCS.

The hierarchy of Boolean circuits

Pavel Pudlák, 1987 .

The Complexity of Computations

Pavel Pudlák, P. Pudlák, 2013 .

An improved exponential-time algorithm for k-SAT

Michael E. Saks, Pavel Pudlák, Ramamohan Paturi, 2005, JACM.

Computing Boolean functions by polynomials and threshold circuits

Pavel Pudlák, Matthias Krause, 1998, computational complexity.

A note on monotone complexity and the rank of matrices

Pavel Pudlák, Anna Gál, 2003, Inf. Process. Lett..

Gödel and computations: a 100th anniversary retrospective

Pavel Pudlák, 2006, SIGA.

Two lower bounds for branching programs

Vojtech Rödl, János Komlós, Endre Szemerédi, 1986, STOC '86.

Graph complexity

Vojtech Rödl, Pavel Pudlák, Petr Savický, 1988, Acta Informatica.

Top-down lower bounds for depth 3 circuits

Pavel Pudlák, Johan Håstad, Stasys Jukna, 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

Models of the alternative set theory

Pavel Pudlák, Antonín Sochor, P. Pudlák, 1984, Journal of Symbolic Logic.

The number of proof lines and the size of proofs in first order logic

Jan Krajícek, Pavel Pudlák, J. Krajícek, 1988, Arch. Math. Log..

Lower bounds on Hilbert's Nullstellensatz and propositional proofs

Jan Krajícek, Russell Impagliazzo, Toniann Pitassi, 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

Interactive Computations of Optimal Solutions

Jan Krajícek, Jirí Sgall, Pavel Pudlák, 1990, MFCS.

Petr Hajek, 1940-2016

Pavel Pudlák, P. Pudlák, 2017, Bull. EATCS.

Preface to the Series Perspectives in Mathematical Logic

Pavel Pudlák, Petr Hájek, A. Levy, 2016 .

On the Communication Complexity of Planarity

Pavel Pudlák, Pavol Duris, 1989, FCT.

Fragments of bounded arithmetic and the lengths of proofs

Pavel Pudlák, 2008, J. Symb. Log..

06111 Abstracts Collection -- Complexity of Boolean Functions

Dieter van Melkebeek, Pavel Pudlák, Rüdiger Reischuk, 2006, Complexity of Boolean Functions.

Erratum to: "A note on monotone complexity and the rank of matrices": [Information Processing Letters 87 (2003) 321-326]

Pavel Pudlák, Anna Gál, 2003, Inf. Process. Lett..

Superconcentrators of Depths 2 and 3; Odd Levels Help (Rarely)

Noga Alon, Pavel Pudlák, N. Alon, 1994, J. Comput. Syst. Sci..

Parity Games and Propositional Proofs

Pavel Pudlák, Neil Thapen, Arnold Beckmann, 2013, TOCL.

Algebraic models of computation and interpolation for algebraic proof systems

Jirí Sgall, Pavel Pudlák, J. Sgall, 1996, Proof Complexity and Feasible Arithmetics.

Bounded Arithmetic and the Polynomial Hierarchy

Jan Krajícek, Pavel Pudlák, Gaisi Takeuti, 1991, Ann. Pure Appl. Log..

Some combinatorial-algebraic problems from complexity theory

Vojtech Rödl, Pavel Pudlák, 1994, Discret. Math..

Monotone simulations of non-monotone proofs

Pavel Pudlák, Albert Atserias, Nicola Galesi, 2001, J. Comput. Syst. Sci..

Twelve Problems in Proof Complexity

Pavel Pudlák, P. Pudlák, 2008, CSR.

Linear tree codes and the problem of explicit constructions pdf

Pavel Pudlák, P. Pudlák, 2013, ArXiv.

A lower bound on the size of resolution proofs of the Ramsey theorem

Pavel Pudlák, 2012, Inf. Process. Lett..

Mathematician’s World

Pavel Pudlák, 2013 .

Some structural properties of low-rank matrices related to computational complexity

Pavel Pudlák, Bruno Codenotti, Giovanni Resta, 2000, Theor. Comput. Sci..

On computing Boolean functions by sparse real polynomials

Pavel Pudlák, Matthias Krause, 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

An Application of Hindman's Theorem to a Problem on Communication Complexity

Pavel Pudlák, 2003, Comb. Probab. Comput..

Complexity theory and genetics

Pavel Pudlák, 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

Tighter Hard Instances for PPSZ pdf

Pavel Pudlák, Dominik Scheder, Navid Talebanfard, 2016, ICALP.

On Search Problems in Complexity Theory and in Logic (Abstract)

Pavel Pudlák, 2006, CIAC.

Threshold circuits of bounded depth

Pavel Pudlák, Wolfgang Maass, Mario Szegedy, 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

Elementary Extensions of Models of the Alternative Set Theory

Pavel Pudlák, Antonín Sochor, 1985, Math. Log. Q..

Complexity Theory and Genetics: The Computational Power of Crossing Over

Pavel Pudlák, 2001, Inf. Comput..

Partition Expanders

Dmitry Gavinsky, Pavel Pudlák, 2016, Theory of Computing Systems.

Satisfiability - Algorithms and Logic

Pavel Pudlák, P. Pudlák, 1998, MFCS.

On the Entropy of Locally-Independent Bernoulli Trials pdf

Dmitry Gavinsky, Pavel Pudlák, 2015, ArXiv.

An Exponenetioal Lower Bound to the Size of Bounded Depth Frege Proofs of the Pigeonhole Principle

Jan Krajícek, Pavel Pudlák, Alan R. Woods, 1995, Random Struct. Algorithms.

Circuit lower bounds and linear codes

Pavel Pudlák, Ramamohan Paturi, P. Pudlák, 2006, Electron. Colloquium Comput. Complex..

Qualitative and Probabilistic Models of Full Belief

Samuel R. Buss, Petr Hájek, Pavel Pudlák, 2016 .

Logical Foundations of Mathematics and Computational Complexity - A Gentle Introduction

Pavel Pudlák, 2013, Springer monographs in mathematics.

On the complexity of circuit satisfiability

Pavel Pudlák, Ramamohan Paturi, P. Pudlák, 2010, STOC '10.

Proof complexity in algebraic systems and bounded depth Frege systems with modular counting

Jan Krajícek, Alexander A. Razborov, Samuel R. Buss, 1997, computational complexity.

Godel and Computations

Pavel Pudlák, 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).

A wild model of linear arithmetic and discretely ordered modules

Pavel Pudlák, Petr Glivický, P. Pudlák, 2016, Math. Log. Q..

On shifting networks

Pavel Pudlák, Petr Savický, 1993, Theor. Comput. Sci..

Top-down lower bounds for depth-three circuits

Pavel Pudlák, Johan Håstad, Stasys Jukna, 1995, computational complexity.

Quantified propositional calculi and fragments of bounded arithmetic

Jan Krajícek, Pavel Pudlák, 1990, Math. Log. Q..

Proof Complexity (Dagstuhl Seminar 18051)

Rahul Santhanam, Pavel Pudlák, Albert Atserias, 2018, Dagstuhl Reports.

Metamathematics of First-Order Arithmetic

Petr Hájek, Pavel Pudlák, P. Hájek, 1993, Perspectives in mathematical logic.

Proofs as Games

Pavel Pudlák, 2000, Am. Math. Mon..

A Note on Applicability of the Incompleteness Theorem to Human Mind

Pavel Pudlák, P. Pudlák, 1999, Ann. Pure Appl. Log..

Random Formulas, Monotone Circuits, and Interpolation

Pavel Pudlák, Pavel Hrubes, P. Pudlák, 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

06111 Executive Summary -- Complexity of Boolean Functions

Dieter van Melkebeek, Pavel Pudlák, Rüdiger Reischuk, 2006, Complexity of Boolean Functions.

Monotone complexity and the rank of matrices

Pavel Pudlák, 2002, Electron. Colloquium Comput. Complex..

On the complexity of finding falsifying assignments for Herbrand disjunctions

Pavel Pudlák, 2015, Arch. Math. Log..

Propositional proof systems, the consistency of first order theories and the complexity of computations

Jan Krajícek, Pavel Pudlák, J. Krajícek, 1989, Journal of Symbolic Logic.

Satisfiability Coding Lemma

Pavel Pudlák, Ramamohan Paturi, Francis Zane, 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

An improved exponential-time algorithm for k-SAT

Michael E. Saks, Pavel Pudlák, Ramamohan Paturi, 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

Communication in bounded depth circuits

Pavel Pudlák, P. Pudlák, 1994, Comb..

Lower bounds for resolution and cutting plane proofs and monotone computations

Pavel Pudlák, P. Pudlák, 1997, Journal of Symbolic Logic.

New Lower Bound for Polyhedral Membership Problem with an Application to Linear Programming

Pavel Pudlák, Jaroslav Morávek, J. Morávek, 1984, MFCS.

How to Lie Without Being (Easily) Convicted and the Length of Proofs in Propositional Calculus

Samuel R. Buss, Pavel Pudlák, S. Buss, 1994, CSL.

Lower Bounds to the Complexity of Symmetric Boolean Functions

Vojtech Rödl, Endre Szemerédi, Pavel Pudlák, 1990, Theor. Comput. Sci..

Polynomially Complete Problems in the Logic of Automated Discovery

Pavel Pudlák, 1975, MFCS.

Parallel strategies

Pavel Pudlák, 2003, J. Symb. Log..

Monotone simulations of nonmonotone propositional proofs

Pavel Pudlák, Albert Atserias, Nicola Galesi, 2000, Electron. Colloquium Comput. Complex..

An Upper Bound for a Communication Game Related to Time-Space Tradeoffs

Jirí Sgall, Pavel Pudlák, J. Sgall, 1995, The Mathematics of Paul Erdős I.

A note on monotone real circuits

Pavel Pudlák, Pavel Hrubes, 2018, Inf. Process. Lett..

Lower bounds for circuits with MOD_m gates

Pavel Pudlák, Denis Thérien, Arkadev Chattopadhyay, 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

Cycles of Nonzero Elements in Low Rank Matrices

Pavel Pudlák, 2002, Comb..

Bounded-depth circuits: separating wires from gates

Pavel Pudlák, Denis Thérien, Michal Koucký, 2005, STOC '05.

Partition Expanders

Dmitry Gavinsky, Pavel Pudlák, 2014, STACS.

Partition theorems for systems of finite subsets of integers

Vojtech Rödl, Pavel Pudlák, 1982, Discret. Math..

Complexity Theory and Genetics (extended abstract)

Pavel Pudlák, 1994, Electron. Colloquium Comput. Complex..

Backtracking Based k-SAT Algorithms

Michael E. Saks, Pavel Pudlák, Ramamohan Paturi, 2008, Encyclopedia of Algorithms.

On Sparse Parity Chack Matrices (Extended Abstract)

Hanno Lefmann, Pavel Pudlák, Petr Savický, 1996, COCOON.

Quantum deduction rules

Pavel Pudlák, 2009, Ann. Pure Appl. Log..

On reducibility and symmetry of disjoint NP pairs

Pavel Pudlák, P. Pudlák, 2003, Theor. Comput. Sci..

On convex complexity measures

Pavel Pudlák, Stasys Jukna, Pavel Hrubes, 2009, Theor. Comput. Sci..

Unexpected Upper Bounds on the Complexity of Some Communication Games

Pavel Pudlák, 1994, ICALP.

A Lower Bound on Complexity of Branching Programs (Extended Abstract)

Pavel Pudlák, 1984, MFCS.

On reducibility and symmetry of disjoint NP pairs

Pavel Pudlák, 2003, Theor. Comput. Sci..

Alternating minima and maxima, Nash equilibria and Bounded Arithmetic

Pavel Pudlák, Neil Thapen, 2012, Ann. Pure Appl. Log..

The Propositional Satisfiability Problem -- Algorithms and Lower Bounds (Dagstuhl Seminar 03141)

Osamu Watanabe, Pavel Pudlák, Uwe Schöning, 2021 .

Congruence lattices of finite algebras and intervals in subgroup lattices of finite groups

Pavel Pudlák, Péter Pál Pálfy, 1980 .

Equilateral sets in l np

Noga Alon, Pavel Pudlák, N. Alon, 2002 .

A new proof of the congruence lattice representation theorem

Pavel Pudlák, 1976 .

Chapter II: Fragments and Combinatorics

Petr Hájek, Pavel Pudlák, P. Hájek, 1998 .

A Lattice of Chapters of Mathematics

Alan S. Stern, Pavel Pudlák, Jan Mycielski, 1990 .

On Explicit Ramsey Graphs and Estimates of the Number of Sums and Products

Pavel Pudlák, P. Pudlák, 2006 .

On a unification problem related to Kreisel's conjecture

Pavel Pudlák, P. Pudlák, 1988 .

The observational predicate calculus and complexity of computations (Preliminary communication)

Pavel Pudlák, P. Pudlák, 1975 .

“Just Because”: Taking Belief Bases Seriously

Samuel R. Buss, Petr Hájek, Pavel Pudlák, 2016 .

A Lattice of Chapters of Mathematics: Interpretations Between Theorems

Alan S. Stern, Pavel Pudlák, Jan Mycielski, 1990 .

The complexity of proving that a graph is Ramsey

Vojtech Rödl, Pavel Pudlák, Neil Thapen, 2017 .

A note on bounded arithmetic

Pavel Pudlák, P. Pudlák, 1990 .

A definition of exponentiation by a bounded arithmetical formula

Pavel Pudlák, 1983 .

Some prime elements in the lattice of interpretability types

Pavel Pudlák, 1983 .

A Note on Boolean Dimension of Posets

Pavel Pudlák, Jaroslav Nešetřil, 1989 .

Classification of Subsheaves over GL-Algebras

Samuel R. Buss, Petr Hájek, Pavel Pudlák, 2016 .

Every finite lattice can be embedded in a finite partition lattice

Pavel Pudlák, P. Pudlák, Jiří T⫲ma, 1980 .

Continuous Images of Coanalytic Sets

Greg Hjorth, Samuel R. Buss, Petr Hájek, 2016 .

Pseudorandom sets and explicit constructions of ramsey graphs

Vojtech Rödl, Pavel Pudlák, V. Rödl, 2004 .

Some Relations Between Subsystems of Arithmetic and Complexity of Computations

Pavel Pudlák, 1992 .