A linear-time algorithm for testing the truth of certain quantified boolean formulas
- 1 March 1979
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 8 (3), 121-123
- https://doi.org/10.1016/0020-0190(79)90002-4
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- The complexity of satisfiability problemsPublished by Association for Computing Machinery (ACM) ,1978
- On the Complexity of Timetable and Multicommodity Flow ProblemsSIAM Journal on Computing, 1976
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971