✦ LIBER ✦

Semialgebraic complexity of functions

✍ Scribed by Y. Yomdin

Book ID: 108163740
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 437 KB
Volume: 21
Category: Article
ISSN: 0885-064X
DOI: 10.1016/j.jco.2003.09.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity of Finding Irreducible Compon

Complexity of Finding Irreducible Components of a Semialgebraic Set

✍ A. Galligo; N. Vorobjov 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 777 KB

Complexity of Computing the Local Dimens

Complexity of Computing the Local Dimension of a Semialgebraic Set

✍ Nicolai Vorobjov 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 521 KB

The paper describes several algorithms related to a problem of computing the local dimension of a semialgebraic set. Let a semialgebraic set V be defined by a system of k inequalities of the form f ≥ 0 with f ∈ R[X 1 , . . . , Xn], deg(f ) < d, and x ∈ V . An algorithm is constructed for computing t

A measure for semialgebraic sets related

A measure for semialgebraic sets related to Boolean complexity

✍ Gilbert Stengle 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 351 KB

Computational complexity of functions

✍ Leonid A. Levin 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 330 KB

Parametrization of semialgebraic sets

✍ M.J. González-López; T. Recio; F. Santos 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 826 KB

Computational Complexity of Algebraic Fu

Computational Complexity of Algebraic Functions

✍ Nicholas Pippenger 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 919 KB