The complexity of the falsifiability problem for pure implicational formulas
From MaRDI portal
Publication:5917958
DOI10.1016/S0166-218X(99)00036-0zbMath0941.68153MaRDI QIDQ5917958
Publication date: 17 January 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Nonnumerical algorithms (68W05) Data structures (68P05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cites Work