Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Bonet, M.L.
Pitassi, T.
and
Raz, R.
1997.
No feasible interpolation for TC/sup 0/-Frege proofs.
p.
254.
Jukna, S.
1997.
Finite limits and monotone computations: the lower bounds criterion.
p.
302.
Pudlák, Pavel
1998.
Handbook of Proof Theory.
Vol. 137,
Issue. ,
p.
547.
Johannsen, Jan
1998.
Lower bounds for monotone real circuit depth and formula size and tree-like Cutting Planes.
Information Processing Letters,
Vol. 67,
Issue. 1,
p.
37.
Bonet, M.L.
Esteban, J.L.
Galesi, N.
and
Johannsen, J.
1998.
Exponential separations between restricted resolution and cutting planes proof systems.
p.
638.
Krajı́ček, Jan
and
Pudlák, Pavel
1998.
Some Consequences of Cryptographical Conjectures forS12and EF.
Information and Computation,
Vol. 140,
Issue. 1,
p.
82.
Pudlák, Pavel
1998.
Mathematical Foundations of Computer Science 1998.
Vol. 1450,
Issue. ,
p.
129.
Eisenbrand, Friedrich
and
Schulz, Andreas S.
1999.
Integer Programming and Combinatorial Optimization.
Vol. 1610,
Issue. ,
p.
137.
Esteban, Juan Luis
and
Torán, Jacobo
1999.
STACS 99.
Vol. 1563,
Issue. ,
p.
551.
Bonet, M.L.
Domingo, C.
Gavalda, R.
Maciel, A.
and
Pitassi, T.
1999.
Non-automatizability of bounded-depth Frege proofs.
p.
15.
Buss, Samuel R.
1999.
Computational Logic.
p.
127.
Haken, Armin
and
Cook, Stephen A.
1999.
An Exponential Lower Bound for the Size of Monotone Real Circuits.
Journal of Computer and System Sciences,
Vol. 58,
Issue. 2,
p.
326.
Bonet, Maria Luisa
Pitassi, Toniann
and
Raz, Ran
2000.
On Interpolation and Automatization for Frege Systems.
SIAM Journal on Computing,
Vol. 29,
Issue. 6,
p.
1939.
Atserias, Albert
Galesi, Nicola
and
Gavaldá, Ricard
2000.
Automata, Languages and Programming.
Vol. 1853,
Issue. ,
p.
151.
Harnik, Danny
and
Raz, Ran
2000.
Higher lower bounds on monotone size.
p.
378.
Arai, Noriko H.
2000.
No feasible monotone interpolation for simple combinatorial reasoning.
Theoretical Computer Science,
Vol. 238,
Issue. 1-2,
p.
477.
Bonet, Maria Luisa
Esteban, Juan Luis
Galesi, Nicola
and
Johannsen, Jan
2000.
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems.
SIAM Journal on Computing,
Vol. 30,
Issue. 5,
p.
1462.
Bockmayr, Alexander
and
Eisenbrand, Friedrich
2000.
Frontiers of Combining Systems.
Vol. 1794,
Issue. ,
p.
1.
Arai, Noriko H.
and
Urquhart, Alasdair
2000.
Automated Reasoning with Analytic Tableaux and Related Methods.
Vol. 1847,
Issue. ,
p.
40.
2000.
Logic‐Based Methods for Optimization.
p.
463.