✦ LIBER ✦

Computational Complexity of Algebraic Functions

✍ Scribed by Nicholas Pippenger

Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 919 KB
Volume: 22
Category: Article
ISSN: 0022-0000
DOI: 10.1016/0022-0000(81)90043-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Correction to “Computational complexity

Correction to “Computational complexity of algebraic functions”

✍ Nicholas Pippenger 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 269 KB

Semi-algebraic Complexity—Additive Compl

Semi-algebraic Complexity—Additive Complexity of Matrix Computational Tasks

✍ Thomas Lickteig; Klaus Meer 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 621 KB

The computational complexity of a set of

The computational complexity of a set of quadratic functions

✍ Joseph Ja'Ja' 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 582 KB

Symmetric Function Algebra on a Computer

✍ P.R. Stein; C. Zemach 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 886 KB

Computational complexity of PERT problem

Computational complexity of PERT problems

✍ Jane N. Hagstrom 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 415 KB

Decomposition of Algebraic Functions

✍ Dexter Kozen; Susan Landau; Richard Zippel 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 554 KB

Functional decomposition-whether a function f (x) can be written as a composition of functions g(h(x)) in a non-trivial way-is an important primitive in symbolic computation systems. The problem of univariate polynomial decomposition was shown to have an efficient solution by Kozen and Landau (1989)