Proof of the interval satisfiability conjecture

DOI10.1007/BF01534456MaRDI QIDQ1924736zbMATH OpenWikidataFDO

Authors Adam Brooks Webber

Publication date 17 August 1997

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01534456

zbMATH Keywords

interval satisfiabilityNP-completeness

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• Satisfiability problems on intervals and unit intervals
• Complexity and algorithms for reasoning about time
• On the r,s-SAT satisfiability problem and a conjecture of Tovey
• On satisfiability problems with a linear structure

Cites work

• Complexity and algorithms for reasoning about time
• The complexity of satisfiability problems

This page was built for publication: Proof of the interval satisfiability conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1924736)