Counting connected components of a semialgebraic set in subexponential time (Q1207337): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Dima Yu. Grigoriev / rank
Normal rank
 
Property / author
 
Property / author: Dima Yu. Grigoriev / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of elementary algebra and geometry / 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: Q4079605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5643279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of deciding Tarski algebra / 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: Definability and fast quantifier elimination in algebraically closed fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4771357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5807665 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:40, 17 May 2024

scientific article
Language Label Description Also known as
English
Counting connected components of a semialgebraic set in subexponential time
scientific article

    Statements

    Identifiers