scientific article; zbMATH DE number 1304340
From MaRDI portal
Publication:4251071
zbMath0924.03020MaRDI QIDQ4251071
Juan Luis Esteban, Jacobo Toran
Publication date: 17 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
propositional logicresolutioncomplexity measurespebble gameCNF formulaspace boundsunsatisfiable formula
Analysis of algorithms and problem complexity (68Q25) Mechanization of proofs and logical operations (03B35) Complexity of computation (including implicit computational complexity) (03D15) Classical propositional logic (03B05)
Related Items (4)
An Introduction to Lower Bounds on Resolution Proof Systems ⋮ An Upper Bound on the Space Complexity of Random Formulae in Resolution ⋮ Verifying time, memory and communication bounds in systems of reasoning agents ⋮ Space bounds for resolution
This page was built for publication: