𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity of Finding Irreducible Components of a Semialgebraic Set

✍ Scribed by A. Galligo; N. Vorobjov

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
777 KB
Volume
11
Category
Article
ISSN
0885-064X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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