The complexity of the falsifiability problem for pure implicational formulas

DOI10.1016/S0166-218X(99)00036-0zbMath0941.68153MaRDI QIDQ5917958

Peter Heusch

Publication date: 17 January 2000

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

falsifiability

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Data structures (68P05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cites Work

• Nested satisfiability
• Polynomially solvable satisfiability problems
• Unnamed Item
• Unnamed Item

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