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

Bengt Aspvall, Michael F. Plass, Robert Endre Tarjan

Research output: Contribution to journalArticlepeer-review

629 Scopus citations
Original languageEnglish (US)
Pages (from-to)121-123
Number of pages3
JournalInformation Processing Letters
Volume8
Issue number3
DOIs
StatePublished - Mar 15 1979
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Keywords

  • 2-CNF
  • 2-satisfiability
  • Quantified Boolean formula
  • strongly connected components

Fingerprint

Dive into the research topics of 'A linear-time algorithm for testing the truth of certain quantified boolean formulas'. Together they form a unique fingerprint.

Cite this