Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
Jalali, Raheleh
2019.
Logic, Language, Information, and Computation.
Vol. 11541,
Issue. ,
p.
342.
Pich, Jan
and
Santhanam, Rahul
2019.
Why are Proof Complexity Lower Bounds Hard?.
p.
1305.
Ramos, Jaime
Rasga, João
and
Sernadas, Cristina
2021.
Schema Complexity in Propositional-Based Logics.
Mathematics,
Vol. 9,
Issue. 21,
p.
2671.
Böhm, Benjamin
and
Beyersdorff, Olaf
2021.
Theory and Applications of Satisfiability Testing – SAT 2021.
Vol. 12831,
Issue. ,
p.
47.
Goos, Mika
Hollender, Alexandros
Jain, Siddhartha
Maystre, Gilbert
Pires, William
Robere, Robert
and
Tao, Ran
2022.
Separations in Proof Complexity and TFNP.
p.
1150.
Chen, Lijie
Jin, Ce
Santhanam, Rahul
and
Williams, R. Ryan
2022.
Constructive Separations and Their Consequences.
p.
646.
Andrews, Robert
and
Forbes, Michael A.
2022.
Ideals, determinants, and straightening: proving and using lower bounds for polynomial ideals.
p.
389.
Bonacina, Ilario
and
Bonet, Maria Luisa
2022.
On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems.
p.
1.
Khaniki, Erfan
2022.
On Proof Complexity of Resolution over Polynomial Calculus.
ACM Transactions on Computational Logic,
Vol. 23,
Issue. 3,
p.
1.
KHANIKI, ERFAN
2022.
NEW RELATIONS AND SEPARATIONS OF CONJECTURES ABOUT INCOMPLETENESS IN THE FINITE DOMAIN.
The Journal of Symbolic Logic,
Vol. 87,
Issue. 3,
p.
912.
Carmosino, Marco
Kabanets, Valentine
Kolokolova, Antonina
and
Oliveira, Igor C.
2022.
LEARN-Uniform Circuit Lower Bounds and Provability in Bounded Arithmetic.
p.
770.
Gläser, Max
and
Pfetsch, Marc E.
2022.
Integer Programming and Combinatorial Optimization.
Vol. 13265,
Issue. ,
p.
291.
KRAJÍČEK, JAN
2022.
INFORMATION IN PROPOSITIONAL PROOFS AND ALGORITHMIC PROOF SEARCH.
The Journal of Symbolic Logic,
Vol. 87,
Issue. 2,
p.
852.
Buss, Sam
2022.
Alasdair Urquhart on Nonclassical and Algebraic Logic and Complexity of Proofs.
Vol. 22,
Issue. ,
p.
477.
KRAJÍČEK, JAN
2023.
A PROOF COMPLEXITY CONJECTURE AND THE INCOMPLETENESS THEOREM.
The Journal of Symbolic Logic,
p.
1.
Berkholz, Christoph
and
Nordström, Jakob
2023.
Near-optimal Lower Bounds on Quantifier Depth and Weisfeiler–Leman Refinement Steps.
Journal of the ACM,
Vol. 70,
Issue. 5,
p.
1.
Folwarczný, Lukáš
2023.
On Protocols for Monotone Feasible Interpolation.
ACM Transactions on Computation Theory,
Vol. 15,
Issue. 1-2,
p.
1.
Li, Jiatu
and
Oliveira, Igor C.
2023.
Unprovability of Strong Complexity Lower Bounds in Bounded Arithmetic.
p.
1051.
Tamazyan, Hakob A.
and
Chubaryan, Anahit A.
2024.
A Hierarchy of Determinative Sequent Systems with Different Substitution Rules.
Pattern Recognition and Image Analysis,
Vol. 34,
Issue. 1,
p.
20.
Chen, Yilei
and
Li, Jiatu
2024.
Hardness of Range Avoidance and Remote Point for Restricted Circuits via Cryptography.
p.
620.
