Construction of roadmaps in semi-algebraic sets (Q1311619): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Jean-Jacques Risler / rank | |||
Property / reviewed by | |||
Property / reviewed by: Selman Akbulut / rank | |||
Property / author | |||
Property / author: Jean-Jacques Risler / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Selman Akbulut / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3996250 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Constructing roadmaps of semi-algebraic sets. I: Completeness / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Generalised characteristic polynomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4038743 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3973331 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding connected components of a semialgebraic set in subexponential time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solving systems of polynomial inequalities in subexponential time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexity of deciding Tarski algebra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Definability and fast quantifier elimination in algebraically closed fields / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4295432 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3360296 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Betti Numbers of Real Varieties / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3973667 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 12:19, 22 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Construction of roadmaps in semi-algebraic sets |
scientific article |
Statements
Construction of roadmaps in semi-algebraic sets (English)
0 references
5 March 1995
0 references
The authors describe an algorithm for constructing a roadmap for a compact semialgebraic set \(S \subset R^ n\). This is similar to J. Canny's algorithm, but somewhat simpler and is more general. If the number of defining equations of \(S\) is \(k\) and \(n\) is the number of variables, and \(d\) is the maximal degree, then the algorithm runs in time \((kd)^{O(n^ 3)}\).
0 references
construction of a roadmap
0 references
compact semialgebraic set
0 references