The complexity of the falsifiability problem for pure implicational formulas

DOI10.1007/3-540-60246-1_128zbMath1193.68132OpenAlexW1530996181MaRDI QIDQ5900975

Peter Heusch

Publication date: 17 June 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://kups.ub.uni-koeln.de/54695/1/zpr95-189.pdf

zbMATH Keywords

data structureslogic in computer sciencesubject classification algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Classical propositional logic (03B05)

Related Items (3)

Improving a fixed parameter tractability time bound for the shadow problem ⋮ On generalizations of the shadow independent set problem ⋮ Special issues on The satisfiability problem (pp. 1--244) including papers from the 1st workshop on satisfiability, Certosa di Pontignano, Italy, April 29--May 3, 1996 and Boolean functions (pp. 245--479)

This page was built for publication: The complexity of the falsifiability problem for pure implicational formulas