| Publication | Date of Publication | Type |
|---|
| Jan Krajìček, Proof Complexity, Encyclopedia of Mathematics and Its Applications, no. 170, Cambridge University Press, Cambridge, UK, 2019, xvi + 516 pp. | 2023-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6161059 | 2023-06-26 | Paper |
| On the Consistency of Circuit Lower Bounds for Non-Deterministic Time | 2023-03-02 | Paper |
| A parameterized halting problem, $\Delta_0$ truth and the MRDP theorem | 2022-11-11 | Paper |
| On representations of intended structures in foundational theories | 2022-04-04 | Paper |
| Typical forcings, NP search problems and an extension of a theorem of Riis | 2021-03-25 | Paper |
| A parameterized halting problem, the linear time hierarchy, and the MRDP theorem | 2021-01-20 | Paper |
| COBHAM RECURSIVE SET FUNCTIONS AND WEAK SET THEORIES | 2020-12-02 | Paper |
| Automating Resolution is NP-Hard | 2020-11-11 | Paper |
| A remark on pseudo proof systems and hard instances of the satisfiability problem | 2020-05-11 | Paper |
| Polynomial time ultrapowers and the consistency of circuit lower bounds | 2020-01-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4972729 | 2019-11-26 | Paper |
| Feasibly constructive proofs of succinct weak circuit lower bounds | 2019-11-22 | Paper |
| Feasible set functions have small circuits | 2019-10-28 | Paper |
| One hierarchy spawns another | 2018-04-23 | Paper |
| One Hierarchy Spawns Another | 2018-03-22 | Paper |
| The parameterized space complexity of embedding along a path | 2017-10-12 | Paper |
| The treewidth of proofs | 2017-08-08 | Paper |
| An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction | 2017-05-16 | Paper |
| The fine classification of conjunctive queries and parameterized logarithmic space | 2016-10-24 | Paper |
| Cobham recursive set functions | 2016-01-12 | Paper |
| Hard Instances of Algorithms and Proof Systems | 2015-09-03 | Paper |
| Consistency, optimality, and incompleteness | 2015-08-27 | Paper |
| LOWER BOUNDS FOR DNF-REFUTATIONS OF A RELATIVIZED WEAK PIGEONHOLE PRINCIPLE | 2015-08-14 | Paper |
| Topological dynamics of unordered Ramsey structures | 2015-03-26 | Paper |
| Partially definable forcing and bounded arithmetic | 2015-02-23 | Paper |
| Bounded Variable Logic, Parameterized Logarithmic Space, and Savitch’s Theorem | 2014-10-14 | Paper |
| Revisiting Space in Proof Complexity: Treewidth and Pathwidth | 2013-09-20 | Paper |
| Parameterized random complexity | 2013-04-15 | Paper |
| An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction | 2013-04-09 | Paper |
| Some Definitorial Suggestions for Parameterized Proof Complexity | 2013-01-07 | Paper |
| Hard Instances of Algorithms and Proof Systems | 2012-08-14 | Paper |
| Strong isomorphism reductions in complexity theory | 2011-12-23 | Paper |
| Consistency and Optimality | 2011-09-09 | Paper |
| Lower bounds for kernelizations and other preprocessing procedures | 2011-05-25 | Paper |
| Lower Bounds for Kernelizations and Other Preprocessing Procedures | 2010-07-28 | Paper |
| W-hierarchies defined by symmetric gates | 2010-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3614882 | 2009-03-17 | Paper |
| Parameterized Derandomization | 2008-06-05 | Paper |
| A Purely Democratic Characterization of W[1] | 2008-06-05 | Paper |
| Randomized Approximations of Parameterized Counting Problems | 2008-06-03 | Paper |
