✦ LIBER ✦

The complexity of elementary algebra and geometry

✍ Scribed by Michael Ben-Or; Dexter Kozen; John Reif

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 750 KB
Volume: 32
Category: Article
ISSN: 0022-0000
DOI: 10.1016/0022-0000(86)90029-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of group algebra computat

The complexity of group algebra computations

✍ M.D. Atkinson 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 624 KB

Currents algebra and models of elementar

Currents algebra and models of elementary particles

✍ Susumu Okubo 📂 Article 📅 1966 🏛 Elsevier Science 🌐 English ⚖ 785 KB

Parity non-conservation and the algebra

Parity non-conservation and the algebra of elementary particles

✍ Katsuhiko Sekine 📂 Article 📅 1959 🏛 Elsevier Science ⚖ 511 KB

Models of elementary particles and algeb

Models of elementary particles and algebra of currents

✍ S. Okubo 📂 Article 📅 1966 🏛 Elsevier Science ⚖ 253 KB

The Complexity of the Evaluation of Comp

The Complexity of the Evaluation of Complex Algebra Expressions

✍ Dan Suciu; Jan Paredaens 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 860 KB

The Abiteboul and Beeri algebra for complex objects can express a query whose meaning is transitive closure, but the algorithm naturally associated to this query needs exponential space. We show that any other query in the algebra which expresses transitive closure needs exponential space, under a `

Algebraic grounds for the proof of algeb

Algebraic grounds for the proof of algebraic independence. How to obtain measure of algebraic independence using elementary methods part I. Elementary algebra

✍ G. V. Chudnovsky 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 835 KB