Basicness of semialgebraic sets
A semialgebraic subset in a real algebraic variety is called basic if it is the set of solutions to a system of polynomial inequalities. The main result of the paper is that the basicness of semialgebraic sets on an affine variety defined over the field of real algebraic numbers is decidable. Another result is an explicit recursive decision procedure for basicness, each time splitting the original problem to a finite number of similar ones in one dimension less by desingularizing the ambient variety and the boundary of the semialgebraic set and passing to this boundary.
- Minimal generation of basic semialgebraic sets
- On the separation of basic semialgebraic sets by polynomials
- On basic semialgebraic sets
- An algorithmic criterion for basicness in dimension 2
- Ubiquity of Łojasiewicz's example of a nonbasic semialgebraic set
- Semialgebraic sets and some versions of the Tarski-Seidenberg-Macintyre theorem
- scientific article; zbMATH DE number 1984318 (Why is no real title available?)
- scientific article; zbMATH DE number 1488929 (Why is no real title available?)
- Geometry of maximum likelihood estimation in Gaussian graphical models
- The ambient structure of basic sets
- Strong version of the basic deciding algorithm for the existential theory of real fields
- On the complexity of p-adic basic semi-algebraic sets
This page was built for publication: Basicness of semialgebraic sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1818714)
