Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Razborov, Alexander A.
1996.
Automata, Languages and Programming.
Vol. 1099,
Issue. ,
p.
48.
Buss, S.
Impagliazzo, R.
Krajíček, J.
Pudlák, P.
Razborov, A. A.
and
Sgall, J.
1996.
Proof complexity in algebraic systems and bounded depth Frege systems with modular counting.
Computational Complexity,
Vol. 6,
Issue. 3,
p.
256.
Massacci, Fabio
1997.
AI*IA 97: Advances in Artificial Intelligence.
Vol. 1321,
Issue. ,
p.
219.
Sadowski, Zenon
1997.
Fundamentals of Computation Theory.
Vol. 1279,
Issue. ,
p.
423.
Egly, Uwe
1998.
An answer to an open problem of Urquhart.
Theoretical Computer Science,
Vol. 198,
Issue. 1-2,
p.
201.
Massacci, Fabio
1998.
Automated Reasoning with Analytic Tableaux and Related Methods.
Vol. 1397,
Issue. ,
p.
217.
Bonacina, Maria Paola
1998.
Logics in Artificial Intelligence.
Vol. 1489,
Issue. ,
p.
107.
Messner, Jochen
and
Torán, Jacobo
1998.
STACS 98.
Vol. 1373,
Issue. ,
p.
477.
Bonacina, Maria Paola
and
Hsiang, Jieh
1998.
On the Modelling of Search in Theorem Proving— Towards a Theory of Strategy Analysis.
Information and Computation,
Vol. 147,
Issue. 2,
p.
171.
Bonet, M.L.
Esteban, J.L.
Galesi, N.
and
Johannsen, J.
1998.
Exponential separations between restricted resolution and cutting planes proof systems.
p.
638.
Kupferman, Orna
Kurshan, Robert P.
and
Yannakakis, Mihalis
1998.
Computer Science Logic.
Vol. 1414,
Issue. ,
p.
327.
Grigoriev, D.
1998.
Tseitin's tautologies and lower bounds for Nullstellensatz proofs.
p.
648.
Gu, Jun
1999.
Parallel Processing of Discrete Problems.
Vol. 106,
Issue. ,
p.
85.
Kullmann, O.
1999.
On a generalization of extended resolution.
Discrete Applied Mathematics,
Vol. 96-97,
Issue. ,
p.
149.
D’Agostino, Marcello
1999.
Handbook of Tableau Methods.
p.
45.
Gu, Jun
Gu, Qianping
and
Du, Dingzhu
1999.
On optimizing the satisfiability (SAT) problem.
Journal of Computer Science and Technology,
Vol. 14,
Issue. 1,
p.
1.
Büning, Hans Kleine
and
Lettmann, Theodor
1999.
Resolution remains hard under equivalence.
Discrete Applied Mathematics,
Vol. 96-97,
Issue. ,
p.
139.
Ben-Sasson, Eli
and
Wigderson, Avi
1999.
Short proofs are narrow—resolution made simple.
p.
517.
Urquhart, Alasdair
1999.
The symmetry rule in propositional logic.
Discrete Applied Mathematics,
Vol. 96-97,
Issue. ,
p.
177.
Iwama, Kazuo
and
Miyazaki, Shuichi
1999.
Algorithms and Computation.
Vol. 1741,
Issue. ,
p.
133.