✦ LIBER ✦

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

✍ Scribed by Bengt Aspvall; Michael F. Plass; Robert Endre Tarjan

Book ID: 113162425
Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 42 KB
Volume: 14
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(82)90036-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear-time algorithm for testing the

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

✍ Bengt Aspvall; Michael F. Plass; Robert Endre Tarjan 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 473 KB

An upper bound for the circuit complexit

An upper bound for the circuit complexity of existentially quantified Boolean formulas

✍ H. Kleine Büning; A. Remshagen 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 311 KB

A linear expected-time algorithm for der

A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities

✍ Pierre Hansen; Brigitte Jaumard; Michel Minoux 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 381 KB

On a certain algorithm for the construct

On a certain algorithm for the construction of minimal tests

✍ V. I. Sharapov 📂 Article 📅 1976 🏛 Springer US 🌐 English ⚖ 211 KB

A linear-time algorithm for the generati

A linear-time algorithm for the generation of trees

✍ L. Alonso; J. L. Rémy; R. Schott 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 908 KB

Linear-time algorithms for testing the r

Linear-time algorithms for testing the realisability of line drawings of curved objects

✍ Martin C. Cooper 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 366 KB

This paper shows that the semantic labelling of line drawings of curved objects with piecewise C 3 surfaces is solvable in linear time. This result is robust to changes in the assumptions on object shape. When all vanishing points are known, a different linear-time algorithm exists to solve the labe