Crossref journal-article
Elsevier BV
Information Processing Letters (78)
Bibliography

Aspvall, B., Plass, M. F., & Tarjan, R. E. (1979). A linear-time algorithm for testing the truth of certain quantified boolean formulas. Information Processing Letters, 8(3), 121–123.

Authors 3
  1. Bengt Aspvall (first)
  2. Michael F. Plass (additional)
  3. Robert Endre Tarjan (additional)
References 7 Referenced 592
  1. {'key': '10.1016/0020-0190(79)90002-4_BIB1', 'series-title': 'The Design and Analysis of Computer Algorithms', 'author': 'Aho', 'year': '1974'} / The Design and Analysis of Computer Algorithms by Aho (1974)
  2. 10.1145/800157.805047 / Proc. 3rd Ann. ACM Symp. Theory Comput. / The complexity of theorem proving procedures by Cook (1971)
  3. 10.1137/0205048 / SIAM J. Comput. / On the complexity of timetable and multi-commodity flow problems by Even (1976)
  4. {'key': '10.1016/0020-0190(79)90002-4_BIB4', 'series-title': 'Combinatorial Algorithms: Theory and Practice', 'author': 'Reingold', 'year': '1977'} / Combinatorial Algorithms: Theory and Practice by Reingold (1977)
  5. 10.1145/800133.804350 / Proc. 10th Ann. ACM Symp. Theory Comput. / The complexity of satisfiability problems by Schaefer (1978)
  6. {'key': '10.1016/0020-0190(79)90002-4_BIB6', 'first-page': '1', 'article-title': 'Word problems requiring exponential time', 'author': 'Stockmeyer', 'year': '1973', 'journal-title': 'Proc. 5th Ann. ACM Symp. Theory Comput.'} / Proc. 5th Ann. ACM Symp. Theory Comput. / Word problems requiring exponential time by Stockmeyer (1973)
  7. 10.1137/0201010 / SIAM J. Comput. / Depth first search and linear graph algorithms by Tarjan (1972)
Dates
Type When
Created 23 years ago (July 25, 2002, 8:11 p.m.)
Deposited 6 years, 4 months ago (April 12, 2019, 8:28 a.m.)
Indexed 4 hours, 40 minutes ago (Aug. 23, 2025, 9:44 p.m.)
Issued 46 years, 5 months ago (March 1, 1979)
Published 46 years, 5 months ago (March 1, 1979)
Published Print 46 years, 5 months ago (March 1, 1979)
Funders 0

None

@article{Aspvall_1979, title={A linear-time algorithm for testing the truth of certain quantified boolean formulas}, volume={8}, ISSN={0020-0190}, url={http://dx.doi.org/10.1016/0020-0190(79)90002-4}, DOI={10.1016/0020-0190(79)90002-4}, number={3}, journal={Information Processing Letters}, publisher={Elsevier BV}, author={Aspvall, Bengt and Plass, Michael F. and Tarjan, Robert Endre}, year={1979}, month=mar, pages={121–123} }