Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
Krajíček, Jan
2010.
A form of feasible interpolation for constant depth Frege systems.
The Journal of Symbolic Logic,
Vol. 75,
Issue. 2,
p.
774.
Krajíček, Jan
2010.
Computer Science Logic.
Vol. 6247,
Issue. ,
p.
22.
Cook, Stephen
and
Fontes, Lila
2010.
Computer Science Logic.
Vol. 6247,
Issue. ,
p.
245.
Beyersdorff, Olaf
and
Müller, Sebastian
2010.
A tight Karp-Lipton collapse result in bounded arithmetic.
ACM Transactions on Computational Logic,
Vol. 11,
Issue. 4,
p.
1.
Chen, Yijia
Flum, Jörg
and
Müller, Moritz
2011.
Models of Computation in Context.
Vol. 6735,
Issue. ,
p.
61.
Lê, Dai Tri Man
and
Cook, Stephen A.
2011.
Formalizing Randomized Matching Algorithms.
p.
185.
KRAJÍČEK, JAN
2011.
ON THE PROOF COMPLEXITY OF THE NISAN–WIGDERSON GENERATOR BASED ON A HARD NP ∩ coNP FUNCTION.
Journal of Mathematical Logic,
Vol. 11,
Issue. 01,
p.
11.
Jeřábek, Emil
and
Nguyen, Phuong
2011.
Simulating non-prenex cuts in quantified propositional calculus.
Mathematical Logic Quarterly,
Vol. 57,
Issue. 5,
p.
524.
Probst, Dieter
and
Strahm, Thomas
2011.
Admissible closures of polynomial time computable arithmetic.
Archive for Mathematical Logic,
Vol. 50,
Issue. 5-6,
p.
643.
Flum, Jörg
and
Müller, Moritz
2012.
Parameterized and Exact Computation.
Vol. 7535,
Issue. ,
p.
73.
Le, Dai Tri Man
and
Cook, Stephen A.
2012.
Formalizing Randomized Matching Algorithms.
Logical Methods in Computer Science,
Vol. Volume 8, Issue 3,
Issue. ,
Beyersdorff, Olaf
and
Kutz, Oliver
2012.
Lectures on Logic and Computation.
Vol. 7388,
Issue. ,
p.
1.
Hetzl, Stefan
2012.
Language and Automata Theory and Applications.
Vol. 7183,
Issue. ,
p.
301.
Nguyen, Phuong
and
Cook, Stephen
2012.
The Complexity of Proving the Discrete Jordan Curve Theorem.
ACM Transactions on Computational Logic,
Vol. 13,
Issue. 1,
p.
1.
Cook, Stephen A
and
Fontes, Lila A
2012.
Formal Theories for Linear Algebra.
Logical Methods in Computer Science,
Vol. Volume 8, Issue 1,
Issue. ,
Muller, Sebastian
and
Tzameret, Iddo
2012.
Short Propositional Refutations for Dense Random 3CNF Formulas.
p.
501.
Schulze, Gunnar
Chimiak-Opoka, Joanna
and
Arlow, Jim
2012.
Model Driven Engineering Languages and Systems.
Vol. 7590,
Issue. ,
p.
595.
Wang, Guanyu
Rong, Yongwu
Chen, Hao
Pearson, Carl
Du, Chenghang
Simha, Rahul
Zeng, Chen
and
Emmert-Streib, Frank
2012.
Process-Driven Inference of Biological Network Structure: Feasibility, Minimality, and Multiplicity.
PLoS ONE,
Vol. 7,
Issue. 7,
p.
e40330.
Pudlák, Pavel
2013.
Logical Foundations of Mathematics and Computational Complexity.
p.
583.
Jeřábek, Emil
and
Kołodziejczyk, Leszek Aleksander
2013.
Real closures of models of weak arithmetic.
Archive for Mathematical Logic,
Vol. 52,
Issue. 1-2,
p.
143.