A linear-time algorithm for testing the truth of certain quantified Boolean formulas
type: Item
instance of: scholarly article
title: A linear-time algorithm for testing the truth of certain quantified Boolean formulas
zbMATH Open document ID: 0398.68042
DOI: 10.1016/0020-0190(79)90002-4
author: Bengt Aspvall
author: Michael F. Plass
author: Robert E. Tarjan
published in: Information Processing Letters
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 03G05
zbMATH DE Number: 3619340
zbMATH Keywords: Linear-Time Algorithm
zbMATH Keywords: Testing the Truth of Quantified Boolean Formulas
zbMATH Keywords: Finding Strongly Connected
zbMATH Keywords: Components of a Directed Graph
Wikidata QID: Q29394502
MaRDI profile type: Publication
full work available at URL: 0020-0190(79)90002-4
OpenAlex ID: W2031823362
cites work: Q4091421
cites work: The complexity of theorem-proving procedures
cites work: On the Complexity of Timetable and Multicommodity Flow Problems
cites work: Q4144192
cites work: The complexity of satisfiability problems
cites work: Q4131648
cites work: Depth-First Search and Linear Graph Algorithms
description: scientific article; zbMATH DE number 3619340