@article{4c51789425624517a56c53e3e91c40f2,
title = "A linear-time algorithm for testing the truth of certain quantified boolean formulas",
keywords = "2-CNF, 2-satisfiability, Quantified Boolean formula, strongly connected components",
author = "Bengt Aspvall and Plass, {Michael F.} and Tarjan, {Robert Endre}",
note = "Funding Information: * This work was supportedb y National Science Foundation Grants MCS-75-22870 and MCS-77-23738, by Office of Naval Research Contract N00014-76C-0688, by a National Science Foundation Graduate Fellowship, and by a Guggen- heim Fellowship. Reproduction in whole or in part is permitted for any purposes of the United States govern- ment.",
year = "1979",
month = mar,
day = "15",
doi = "10.1016/0020-0190(79)90002-4",
language = "English (US)",
volume = "8",
pages = "121--123",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "3",
}