The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Pavel Pudlák: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Pavel Pudlák
    On Search Problems in Complexity Theory and in Logic (Abstract). [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:5- [Conf]
  3. 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]
  4. Pavel Pudlák
    Complexity Theory and Genetics. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:383-395 [Conf]
  5. Pavel Pudlák
    Godel and Computations (Abstract). [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:3-5 [Conf]
  6. 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]
  7. Jan Krajícek, Pavel Pudlák
    Propositional Provability and Models of Weak Arithmetic. [Citation Graph (0, 0)][DBLP]
    CSL, 1989, pp:193-210 [Conf]
  8. Pavel Pudlák
    Ramsey's Theorem in Bounded Arithmetic. [Citation Graph (0, 0)][DBLP]
    CSL, 1990, pp:308-317 [Conf]
  9. 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]
  10. Pavol Duris, Pavel Pudlák
    On the Communication Complexity of Planarity. [Citation Graph (0, 0)][DBLP]
    FCT, 1989, pp:145-147 [Conf]
  11. Pavel Pudlák
    AC0 Circuit Complexity. [Citation Graph (0, 0)][DBLP]
    FCT, 1993, pp:106-120 [Conf]
  12. 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]
  13. 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]
  14. 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]
  15. Matthias Krause, Pavel Pudlák
    On Computing Boolean Functions by Sparse Real Polynomials. [Citation Graph (0, 0)][DBLP]
    FOCS, 1995, pp:682-691 [Conf]
  16. 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]
  17. Ramamohan Paturi, Pavel Pudlák, Francis Zane
    Satisfiability Coding Lemma. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:566-574 [Conf]
  18. 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]
  19. Pavel Pudlák
    Unexpected Upper Bounds on the Complexity of Some Communication Games. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:1-10 [Conf]
  20. Pavel Pudlák
    Bounds for Hodes-Specker theorem. [Citation Graph (0, 0)][DBLP]
    Logic and Machines, 1983, pp:421-445 [Conf]
  21. 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]
  22. Jan Krajícek, Pavel Pudlák, Jiri Sgall
    Interactive Computations of Optimal Solutions. [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:48-60 [Conf]
  23. 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]
  24. Pavel Pudlák
    On Reducibility and Symmetry of Disjoint NP-Pairs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:621-632 [Conf]
  25. Pavel Pudlák
    Polynomially Complete Problems in the Logic of Automated Discovery. [Citation Graph (0, 0)][DBLP]
    MFCS, 1975, pp:358-361 [Conf]
  26. Pavel Pudlák
    A Lower Bound on Complexity of Branching Programs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:480-489 [Conf]
  27. Pavel Pudlák
    Satisfiability - Algorithms and Logic. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:129-141 [Conf]
  28. 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]
  29. 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]
  30. 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]
  31. 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]
  32. 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]
  33. 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]
  34. 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]
  35. 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]
  36. 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]
  37. 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]
  38. 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]
  39. 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]
  40. 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]
  41. 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]
  42. 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]
  43. 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]
  44. Pavel Pudlák
    Communication in Bounded Depth Circuits. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1994, v:14, n:2, pp:203-216 [Journal]
  45. 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]
  46. 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]
  47. 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]
  48. 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]
  49. 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]
  50. 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]
  51. 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]
  52. 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]
  53. 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]
  54. 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]
  55. 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]
  56. 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]
  57. 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]
  58. 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]
  59. 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]
  60. Jan Krajícek, Pavel Pudlák
    Some Consequences of Cryptographical Conjectures for S12 and EF. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1998, v:140, n:1, pp:82-94 [Journal]
  61. 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]
  62. 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]
  63. 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]
  64. 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]
  65. 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]
  66. 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]
  67. 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]
  68. 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]
  69. Pavel Pudlák
    Gust Editor's Foreword. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:63, n:2, pp:147- [Journal]
  70. 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]
  71. 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]
  72. 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]
  73. 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]
  74. 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]
  75. 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]
  76. 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]
  77. 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]
  78. 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]
  79. 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]
  80. 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]
  81. 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]

  82. Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity. [Citation Graph (, )][DBLP]


  83. Twelve Problems in Proof Complexity. [Citation Graph (, )][DBLP]


  84. 06111 Abstracts Collection -- Complexity of Boolean Functions. [Citation Graph (, )][DBLP]


  85. 06111 Executive Summary -- Complexity of Boolean Functions. [Citation Graph (, )][DBLP]


  86. On the complexity of circuit satisfiability. [Citation Graph (, )][DBLP]


  87. Quantum deduction rules. [Citation Graph (, )][DBLP]


  88. Exponential Separation of Quantum and Classical Non-Interactive Multi-Party Communication Complexity. [Citation Graph (, )][DBLP]


  89. Quantum deduction rules. [Citation Graph (, )][DBLP]


Search in 0.048secs, Finished in 0.052secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002