| Metamathematics of first-order arithmetic P Hájek, P Pudlák Cambridge University Press, 2017 | 1222 | 2017 |
| Lower bounds for resolution and cutting plane proofs and monotone computations P Pudlák The Journal of Symbolic Logic 62 (3), 981-998, 1997 | 557 | 1997 |
| Threshold circuits of bounded depth A Hajnal, W Maass, P Pudlák, M Szegedy, G Turán Journal of Computer and System Sciences 46 (2), 129-154, 1993 | 526 | 1993 |
| An improved exponential-time algorithm for k-SAT R Paturi, P Pudlák, ME Saks, F Zane Journal of the ACM (JACM) 52 (3), 337-364, 2005 | 422 | 2005 |
| Satisfiability coding lemma R Paturi, P Pudlák, F Zane Proceedings 38th Annual Symposium on Foundations of Computer Science, 566-574, 1997 | 263 | 1997 |
| Propositional proof systems, the consistency of first order theories and the complexity of computations J Krajíček, P Pudlák The Journal of Symbolic Logic 54 (3), 1063-1079, 1989 | 252 | 1989 |
| An exponential lower bound to the size of bounded depth Frege proofs of the pigeonhole principle J Krajíček, P Pudlák, A Woods Random structures & algorithms 7 (1), 15-39, 1995 | 223 | 1995 |
| The lengths of proofs P Pudlák Studies in Logic and the Foundations of Mathematics 137, 547-637, 1998 | 215 | 1998 |
| Bounded arithmetic and the polynomial hierarchy J Krajíček, P Pudlák, G Takeuti Annals of pure and applied logic 52 (1-2), 1991 | 205 | 1991 |
| Cuts, consistency statements and interpretations P Pudlák The Journal of Symbolic Logic 50 (2), 423-441, 1985 | 178 | 1985 |
| MaLARea SG1-machine learner for automated reasoning with semantic guidance J Urban, G Sutcliffe, P Pudlák, J Vyskočil International Joint Conference on Automated Reasoning, 441-456, 2008 | 177 | 2008 |
| Lower bounds on Hilbert's Nullstellensatz and propositional proofs P Beame, R Impagliazzo, J Krajíček, T Pitassi, P Pudlák Proceedings of the London Mathematical Society 3 (1), 1-26, 1996 | 173 | 1996 |
| Every finite lattice can be embedded in a finite partition lattice P Pudlák, J T⫲ ma Algebra Universalis 10, 74-95, 1980 | 168 | 1980 |
| Some consequences of cryptographical conjectures fors12and ef J Krajı́ček, P Pudlák Information and Computation 140 (1), 82-94, 1998 | 162 | 1998 |
| Lower bounds for the polynomial calculus and the Gröbner basis algorithm R Impagliazzo, P Pudlák, J Sgall Computational Complexity 8 (2), 127-144, 1999 | 160 | 1999 |
| Exponential lower bounds for the pigeonhole principle P Beame, R Impagliazzo, J Krajíček, T Pitassi, P Pudlák, A Woods Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing …, 1992 | 137 | 1992 |
| Proof complexity in algebraic systems and bounded depth Frege systems with modular counting S Buss, R Impagliazzo, J Krajíček, P Pudlák, AA Razborov, J Sgall Computational Complexity 6, 256-298, 1996 | 136 | 1996 |
| A lower bound for DLL algorithms for k-SAT (preliminary version) P Pudlák, R Impagliazzo Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms …, 2000 | 126 | 2000 |
| Quantified propositional calculi and fragments of bounded arithmetic J Krajíček, P Pudlák Zeitschrift für mathematische Logik und Grundlagen der Mathematik 36 (1), 29-46, 1990 | 126 | 1990 |
| On the computational power of depth 2 circuits with threshold and modulo gates M Krause, P Pudlák Proceedings of the twenty-sixth annual ACM symposium on Theory of computing …, 1994 | 122 | 1994 |
Petr HájekPetr Hajek´s Memorial Page. Institute of Computer Science, Czech Academy of SciencesE-mail confirmado em cs.cas.cz
