A linear-time algorithm for testing the truth of certain quantified boolean formulas☆
References (7)
- et al.
The Design and Analysis of Computer Algorithms
(1974) The complexity of theorem proving procedures
Proc. 3rd Ann. ACM Symp. Theory Comput.
(1971)- et al.
On the complexity of timetable and multi-commodity flow problems
SIAM J. Comput.
(1976)
There are more references available in the full text version of this article.
Cited by (770)
SAT backdoors: Depth beats size
2024, Journal of Computer and System SciencesEfficiently recognizing graphs with equal independence and annihilation numbers
2023, Information Processing LettersComplexity of C<inf>k</inf>-coloring in hereditary classes of graphs
2023, Information and ComputationReachability in choice networks
2023, Discrete OptimizationThe r-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size
2023, Discrete MathematicsA first polynomial non-clausal class in many-valued logic
2023, Fuzzy Sets and Systems
- ☆
This work was supported by National Science Foundation Grants MCS-75-22870 and MCS-77-23738, by Office of Naval Research Contract N00014-76-C-0688, by a National Science Foundation Graduate Fellowship, and by a Guggenheim Fellowship. Reproduction in whole or in part is permitted for any purposes of the United States government.
Copyright © 1979 Published by Elsevier B.V.