Search the dblp DataBase
Pavel Pudlák :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Pavel Pudlák , Frederick N. Springsteel Complexity in Mechanized Hypothesis Formation. [Citation Graph (1, 0)][DBLP ] Theor. Comput. Sci., 1979, v:8, n:, pp:203-225 [Journal ] Pavel Pudlák On Search Problems in Complexity Theory and in Logic (Abstract). [Citation Graph (0, 0)][DBLP ] CIAC, 2006, pp:5- [Conf ] Albert Atserias , Nicola Galesi , Pavel Pudlák Monotone Simulations of Nonmonotone Proofs. [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2001, pp:36-41 [Conf ] Pavel Pudlák Complexity Theory and Genetics. [Citation Graph (0, 0)][DBLP ] Structure in Complexity Theory Conference, 1994, pp:383-395 [Conf ] Pavel Pudlák Godel and Computations (Abstract). [Citation Graph (0, 0)][DBLP ] IEEE Conference on Computational Complexity, 2006, pp:3-5 [Conf ] Hanno Lefmann , Pavel Pudlák , Petr Savický On Sparse Parity Chack Matrices (Extended Abstract). [Citation Graph (0, 0)][DBLP ] COCOON, 1996, pp:41-49 [Conf ] Jan Krajícek , Pavel Pudlák Propositional Provability and Models of Weak Arithmetic. [Citation Graph (0, 0)][DBLP ] CSL, 1989, pp:193-210 [Conf ] Pavel Pudlák Ramsey's Theorem in Bounded Arithmetic. [Citation Graph (0, 0)][DBLP ] CSL, 1990, pp:308-317 [Conf ] Pavel Pudlák , Samuel R. Buss How to Lie Without Being (Easily) Convicted and the Length of Proofs in Propositional Calculus. [Citation Graph (0, 0)][DBLP ] CSL, 1994, pp:151-162 [Conf ] Pavol Duris , Pavel Pudlák On the Communication Complexity of Planarity. [Citation Graph (0, 0)][DBLP ] FCT, 1989, pp:145-147 [Conf ] Pavel Pudlák AC0 Circuit Complexity. [Citation Graph (0, 0)][DBLP ] FCT, 1993, pp:106-120 [Conf ] Paul Beame , Russell Impagliazzo , Jan Krajícek , Toniann Pitassi , Pavel Pudlák Lower Bound on Hilbert's Nullstellensatz and propositional proofs [Citation Graph (0, 0)][DBLP ] FOCS, 1994, pp:794-806 [Conf ] András Hajnal , Wolfgang Maass , Pavel Pudlák , Mario Szegedy , György Turán Threshold circuits of bounded depth [Citation Graph (0, 0)][DBLP ] FOCS, 1987, pp:99-110 [Conf ] Johan Håstad , Stasys Jukna , Pavel Pudlák Top-Down Lower Bounds for Depth 3 Circuits [Citation Graph (0, 0)][DBLP ] FOCS, 1993, pp:124-129 [Conf ] Matthias Krause , Pavel Pudlák On Computing Boolean Functions by Sparse Real Polynomials. [Citation Graph (0, 0)][DBLP ] FOCS, 1995, pp:682-691 [Conf ] Ramamohan Paturi , Pavel Pudlák , Michael E. Saks , Francis Zane An Improved Exponential-Time Algorithm for k -SAT. [Citation Graph (0, 0)][DBLP ] FOCS, 1998, pp:628-637 [Conf ] Ramamohan Paturi , Pavel Pudlák , Francis Zane Satisfiability Coding Lemma. [Citation Graph (0, 0)][DBLP ] FOCS, 1997, pp:566-574 [Conf ] Arkadev Chattopadhyay , Navin Goyal , Pavel Pudlák , Denis Thérien Lower bounds for circuits with MOD_m gates. [Citation Graph (0, 0)][DBLP ] FOCS, 2006, pp:709-718 [Conf ] Pavel Pudlák Unexpected Upper Bounds on the Complexity of Some Communication Games. [Citation Graph (0, 0)][DBLP ] ICALP, 1994, pp:1-10 [Conf ] Pavel Pudlák Bounds for Hodes-Specker theorem. [Citation Graph (0, 0)][DBLP ] Logic and Machines, 1983, pp:421-445 [Conf ] Jan Krajícek , Pavel Pudlák Some Consequences of Cryptographical Conjectures for S_2^1 and EF. [Citation Graph (0, 0)][DBLP ] LCC, 1994, pp:210-220 [Conf ] Jan Krajícek , Pavel Pudlák , Jiri Sgall Interactive Computations of Optimal Solutions. [Citation Graph (0, 0)][DBLP ] MFCS, 1990, pp:48-60 [Conf ] Jaroslav Morávek , Pavel Pudlák New Lower Bound for Polyhedral Membership Problem with an Application to Linear Programming. [Citation Graph (0, 0)][DBLP ] MFCS, 1984, pp:416-424 [Conf ] Pavel Pudlák On Reducibility and Symmetry of Disjoint NP-Pairs. [Citation Graph (0, 0)][DBLP ] MFCS, 2001, pp:621-632 [Conf ] Pavel Pudlák Polynomially Complete Problems in the Logic of Automated Discovery. [Citation Graph (0, 0)][DBLP ] MFCS, 1975, pp:358-361 [Conf ] Pavel Pudlák A Lower Bound on Complexity of Branching Programs (Extended Abstract). [Citation Graph (0, 0)][DBLP ] MFCS, 1984, pp:480-489 [Conf ] Pavel Pudlák Satisfiability - Algorithms and Logic. [Citation Graph (0, 0)][DBLP ] MFCS, 1998, pp:129-141 [Conf ] Pavel Pudlák , Russell Impagliazzo A lower bound for DLL algorithms for k -SAT (preliminary version). [Citation Graph (0, 0)][DBLP ] SODA, 2000, pp:128-136 [Conf ] 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 Two lower bounds for branching programs [Citation Graph (0, 0)][DBLP ] STOC, 1986, pp:30-38 [Conf ] Paul Beame , Russell Impagliazzo , Jan Krajícek , Toniann Pitassi , Pavel Pudlák , Alan R. Woods Exponential Lower Bounds for the Pigeonhole Principle [Citation Graph (0, 0)][DBLP ] STOC, 1992, pp:200-220 [Conf ] Michal Koucký , Pavel Pudlák , Denis Thérien Bounded-depth circuits: separating wires from gates. [Citation Graph (0, 0)][DBLP ] STOC, 2005, pp:257-265 [Conf ] Matthias Krause , Pavel Pudlák On the computational power of depth 2 circuits with threshold and modulo gates. [Citation Graph (0, 0)][DBLP ] STOC, 1994, pp:48-57 [Conf ] Pavel Pudlák , Vojtech Rödl Modified ranks of tensors and the size of circuits. [Citation Graph (0, 0)][DBLP ] STOC, 1993, pp:523-531 [Conf ] Pavel Pudlák , Vojtech Rödl , Petr Savický Graph Complexity. [Citation Graph (0, 0)][DBLP ] Acta Inf., 1988, v:25, n:5, pp:515-535 [Journal ] Samuel R. Buss , Pavel Pudlák On the computational content of intuitionistic propositional proofs. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 2001, v:109, n:1-2, pp:49-63 [Journal ] Jan Krajícek , Pavel Pudlák , Gaisi Takeuti Bounded Arithmetic and the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1991, v:52, n:1-2, pp:143-153 [Journal ] Pavel Pudlák A Note on Applicability of the Incompleteness Theorem to Human Mind. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1999, v:96, n:1-3, pp:335-342 [Journal ] Samuel R. Buss , Russell Impagliazzo , Jan Krajícek , Pavel Pudlák , Alexander A. Razborov , Jiri Sgall Proof Complexity in Algebraic Systems and Bounded Depth Frege Systems with Modular Counting. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 1997, v:6, n:3, pp:256-298 [Journal ] Johan Håstad , Stasys Jukna , Pavel Pudlák Top-Down Lower Bounds for Depth-Three Circuits. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 1995, v:5, n:2, pp:99-112 [Journal ] Russell Impagliazzo , Pavel Pudlák , Jiri Sgall Lower Bounds for the Polynomial Calculus and the Gröbner Basis Algorithm. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 1999, v:8, n:2, pp:127-144 [Journal ] Matthias Krause , Pavel Pudlák Computing Boolean Functions by Polynomials and Threshold Circuits. [Citation Graph (0, 0)][DBLP ] Computational Complexity, 1998, v:7, n:4, pp:346-370 [Journal ] Ramamohan Paturi , Pavel Pudlák , Francis Zane Satisfiability Coding Lemma. [Citation Graph (0, 0)][DBLP ] Chicago J. Theor. Comput. Sci., 1999, v:1999, n:, pp:- [Journal ] Pavel Pudlák Cycles of Nonzero Elements in Low Rank Matrices. [Citation Graph (0, 0)][DBLP ] Combinatorica, 2002, v:22, n:2, pp:321-334 [Journal ] Pavel Pudlák Communication in Bounded Depth Circuits. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1994, v:14, n:2, pp:203-216 [Journal ] Pavel Pudlák , Vojtech Rödl A combinatorial approach to complexity. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1992, v:12, n:2, pp:221-226 [Journal ] Pavel Pudlák An Application of Hindman's Theorem to a Problem on Communication Complexity. [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 2003, v:12, n:5-6, pp:661-670 [Journal ] Hanno Lefmann , Pavel Pudlák , Petr Savický On Sparse Parity Check Matrices. [Citation Graph (0, 0)][DBLP ] Des. Codes Cryptography, 1997, v:12, n:2, pp:107-130 [Journal ] Albert Atserias , Nicola Galesi , Pavel Pudlák Monotone simulations of nonmonotone propositional proofs [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:87, pp:- [Journal ] Pavel Pudlák On reducibility and symmetry of disjoint NP-pairs [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:44, pp:- [Journal ] Pavel Pudlák Monotone complexity and the rank of matrices [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:007, pp:- [Journal ] Ramamohan Paturi , Pavel Pudlák Circuit lower bounds and linear codes [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:004, pp:- [Journal ] Pavel Pudlák A nonlinear bound on the number of wires in bounded depth circuits [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:122, pp:- [Journal ] Pavel Pudlák Complexity Theory and Genetics (extended abstract) [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 1994, v:1, n:13, pp:- [Journal ] Jan Krajícek , Pavel Pudlák , Alan R. Woods An Exponential Lower Bound to the Size of Bounded Depth Frege Proofs of the Pigeonhole Principle [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 1994, v:1, n:18, pp:- [Journal ] Matthias Krause , Pavel Pudlák On the Computational Power of Depth 2 Circuits with Threshold and Modulo Gates [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 1994, v:1, n:23, pp:- [Journal ] Pavel Pudlák , Jiri Sgall An Upper Bound for a Communication Game Related to Time-Space Tradeoffs [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:10, pp:- [Journal ] Russell Impagliazzo , Pavel Pudlák , Jiri Sgall Lower Bounds for the Polynomial Calculus and the Groebner Basis Algorithm [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:42, pp:- [Journal ] Bruno Codenotti , Pavel Pudlák , Giovanni Resta Some structural properties of low rank matrices related to computational complexity [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:43, pp:- [Journal ] Pavel Pudlák A Note On the Use of Determinant for Proving Lower Bounds on the Size of Linear Circuits [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:42, pp:- [Journal ] Jan Krajícek , Pavel Pudlák Some Consequences of Cryptographical Conjectures for S1 2 and EF. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1998, v:140, n:1, pp:82-94 [Journal ] Pavel Pudlák Complexity Theory and Genetics: The Computational Power of Crossing Over. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2001, v:171, n:2, pp:201-223 [Journal ] Anna Gál , Pavel Pudlák A note on monotone complexity and the rank of matrices. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2003, v:87, n:6, pp:321-326 [Journal ] Anna Gál , Pavel Pudlák Erratum to: "A note on monotone complexity and the rank of matrices": [Information Processing Letters 87 (2003) 321-326]. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2003, v:88, n:5, pp:257- [Journal ] Pavel Pudlák A note on the use of determinant for proving lower bounds on the size of linear circuits. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2000, v:74, n:5-6, pp:197-201 [Journal ] Ramamohan Paturi , Pavel Pudlák , Michael E. Saks , Francis Zane An improved exponential-time algorithm for k -SAT. [Citation Graph (0, 0)][DBLP ] J. ACM, 2005, v:52, n:3, pp:337-364 [Journal ] Albert Atserias , Nicola Galesi , Pavel Pudlák Monotone simulations of non-monotone proofs. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 2002, v:65, n:4, pp:626-638 [Journal ] Noga Alon , Pavel Pudlák Superconcentrators of Depths 2 and 3; Odd Levels Help (Rarely). [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1994, v:48, n:1, pp:194-202 [Journal ] András Hajnal , Wolfgang Maass , Pavel Pudlák , Mario Szegedy , György Turán Threshold Circuits of Bounded Depth. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 1993, v:46, n:2, pp:129-154 [Journal ] Pavel Pudlák Gust Editor's Foreword. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 2001, v:63, n:2, pp:147- [Journal ] Jan Krajícek , Pavel Pudlák Propositional Proof Systems, the Consistency of First Order Theories and the Complexity of Computations. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1989, v:54, n:3, pp:1063-1079 [Journal ] Pavel Pudlák Cuts, Consistency Statements and Interpretations. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1985, v:50, n:2, pp:423-441 [Journal ] Pavel Pudlák Lower Bounds for Resolution and Cutting Plane Proofs and Monotone Computations. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1997, v:62, n:3, pp:981-998 [Journal ] Pavel Pudlák , Antonín Sochor Models of the Alternative Set Theory. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1984, v:49, n:2, pp:570-585 [Journal ] Jan Krajícek , Pavel Pudlák , Alan R. Woods An Exponenetioal Lower Bound to the Size of Bounded Depth Frege Proofs of the Pigeonhole Principle. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1995, v:7, n:1, pp:15-40 [Journal ] Pavel Pudlák , Vojtech Rödl , Jiri Sgall Boolean Circuits, Tensor Ranks, and Communication Complexity. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1997, v:26, n:3, pp:605-633 [Journal ] László Babai , Pavel Pudlák , Vojtech Rödl , Endre Szemerédi Lower Bounds to the Complexity of Symmetric Boolean Functions. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1990, v:74, n:3, pp:313-323 [Journal ] Bruno Codenotti , Pavel Pudlák , Giovanni Resta Some structural properties of low-rank matrices related to computational complexity. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2000, v:235, n:1, pp:89-107 [Journal ] Matthias Krause , Pavel Pudlák On the Computational Power of Depth-2 Circuits with Threshold and Modulo Gates. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1997, v:174, n:1-2, pp:137-156 [Journal ] Pavel Pudlák On reducibility and symmetry of disjoint NP pairs. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:, pp:323-339 [Journal ] Pavel Pudlák , Vojtech Rödl Partition theorems for systems of finite subsets of integers. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1982, v:39, n:1, pp:67-73 [Journal ] Pavel Pudlák , Vojtech Rödl Some combinatorial-algebraic problems from complexity theory. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1994, v:136, n:1-3, pp:253-279 [Journal ] Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity. [Citation Graph (, )][DBLP ] Twelve Problems in Proof Complexity. [Citation Graph (, )][DBLP ] 06111 Abstracts Collection -- Complexity of Boolean Functions. [Citation Graph (, )][DBLP ] 06111 Executive Summary -- Complexity of Boolean Functions. [Citation Graph (, )][DBLP ] On the complexity of circuit satisfiability. [Citation Graph (, )][DBLP ] Quantum deduction rules. [Citation Graph (, )][DBLP ] Exponential Separation of Quantum and Classical Non-Interactive Multi-Party Communication Complexity. [Citation Graph (, )][DBLP ] Quantum deduction rules. [Citation Graph (, )][DBLP ] Search in 0.265secs, Finished in 0.268secs