scientific article; zbMATH DE number 619541
From MaRDI portal
Publication:4302462
zbMath0797.03010MaRDI QIDQ4302462
Publication date: 13 September 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
propositional logicexponential lower boundextended resolutionpigeonhole principlecomplexity of general resolutiontautology problem
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) Complexity of proofs (03F20)
Related Items
Formula dissection: A parallel algorithm for constraint satisfaction, The complexity of Gentzen systems for propositional logic, Unnamed Item, Deciding hypergraph 2-colourability by H-resolution
