Pavel Pudlák
ScholarGPS® ID: 43430468398146
Affiliation History
Discipline
Mathematics
Top Specialties
Logic | Algebra | Combinatorics | Calculus | Discrete Mathematics | Set Theory | Number Theory
Metrics Summary
Publication Count
163
Predicted Citations
5,871
Predicted h-index
40
Ranking
Publications and Citation History
Publications based on Top Specialties
Types of Publication
- Publications
- Books
- Patents
- NIH/NSF
|
Add
Delete
|
|---|
Bounds on Functionality and Symmetric Difference – Two Intriguing Graph Parameters (book chapter) In Graph-Theoretic Concepts in Computer Science Springer Nature Switzerland (2023) |
Extractors for Small Zero-Fixing Sources (journal article) Combinatorica, volume 42, issue 4, pages 587-616 (2022). |
On matrices potentially useful for tree codes (journal article) Information Processing Letters, volume 174 (2022). |
The canonical pairs of bounded depth Frege systems (journal article) Annals of Pure and Applied Logic, volume 172, issue 2, pages 102892- (2021). |
Theory of Computing Systems, volume 64, issue 6, pages 1140-1154 (2020). |
Representations of Monotone Boolean Functions by Linear Programs (journal article) ACM Transactions on Computation Theory, volume 11, issue 4, pages 1-31 (2019). |
Random resolution refutations (journal article) computational complexity, volume 28, issue 2, pages 185-239 (2019). |
A note on monotone real circuits (journal article) Information Processing Letters, volume 131 (2018). |
Beating Brute Force for (Quantified) Satisfiability of Circuits of Bounded Treewidth (book chapter) In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms Society for Industrial and Applied Mathematics (2018) |
INCOMPLETENESS IN THE FINITE DOMAIN (journal article) The Bulletin of Symbolic Logic, volume 23, issue 4, pages 405-441 (2017). |
A wild model of linear arithmetic and discretely ordered modules (journal article) Mathematical Logic Quarterly, volume 63, issue 6, pages 501-508 (2017). |
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) (2017) Berkeley, CA |
The complexity of proving that a graph is Ramsey (journal article) Combinatorica, volume 37, issue 2, pages 253-268 (2017). |
Partition Expanders (journal article) Theory of Computing Systems, volume 60, issue 3, pages 378-395 (2017). |
Consistency and games— in search of new combinatorial principles (book chapter) In Logic Colloquium '03 Cambridge University Press (2017) |
Bounded Arithmetic (book chapter) In Metamathematics of First-Order Arithmetic Cambridge University Press (2017) |
Models of Fragments of Arithmetic (book chapter) In Metamathematics of First-Order Arithmetic Cambridge University Press (2017) |
Self-Reference (book chapter) In Metamathematics of First-Order Arithmetic Cambridge University Press (2017) |
Authors' Preface (book chapter) In Metamathematics of First-Order Arithmetic Cambridge University Press (2017) |
A bottom-up approach to foundations of mathematics (book chapter) In Gödel '96 Cambridge University Press (2017) |