A linear-time algorithm for testing the truth of certain quantified boolean formulas

https://doi.org/10.1016/0020-0190(79)90002-4Get rights and content

First page preview

First page preview
Click to open first page preview

References (7)

  • A.V. Aho et al.

    The Design and Analysis of Computer Algorithms

    (1974)
  • S.A. Cook

    The complexity of theorem proving procedures

    Proc. 3rd Ann. ACM Symp. Theory Comput.

    (1971)
  • S. Even 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 Sciences
  • Reachability in choice networks

    2023, Discrete Optimization
View all citing articles on Scopus

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.

View full text