scientific article; zbMATH DE number 1424047
From MaRDI portal
Publication:4945238
zbMath0942.03010MaRDI QIDQ4945238
Publication date: 23 August 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
resolution refutationlower boundsTseitin formulascomplexity measurepebble gameresolution spacePigeonhole Principle
Mechanization of proofs and logical operations (03B35) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20)
Related Items
A combinatorial characterization of resolution width ⋮ An Upper Bound on the Space Complexity of Random Formulae in Resolution ⋮ Space complexity of random formulae in resolution ⋮ A simplified way of proving trade-off results for resolution ⋮ Reversible pebble games and the relation between tree-like and general resolution space ⋮ Space bounds for resolution
This page was built for publication: