Recommendations
Cites work
- scientific article; zbMATH DE number 3889430 (Why is no real title available?)
- scientific article; zbMATH DE number 3568056 (Why is no real title available?)
- scientific article; zbMATH DE number 3395363 (Why is no real title available?)
- Alternation
- Complete problems for deterministic polynomial time
- Nondeterministic Space is Closed under Complementation
- On the Complexity of Timetable and Multicommodity Flow Problems
- On the unique satisfiability problem
- Satisfiability problems for propositional calculi
- Some simplified NP-complete graph problems
- The complexity of satisfiability problems
- The complexity of theorem-proving procedures
Cited in
(3)
This page was built for publication: A hierarchy of propositional Horn formuls
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1122571)