REVIEW 4 cited by
Algorithms in Real Algebraic Geometry: A Survey
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
We survey both old and new developments in the theory of algorithms in real algebraic geometry -- starting from effective quantifier elimination in the first order theory of reals due to Tarski and Seidenberg, to more recent algorithms for computing topological invariants of semi-algebraic sets. We emphasize throughout the complexity aspects of these algorithms and also discuss the computational hardness of the underlying problems. We also describe some recent results linking the computational hardness of decision problems in the first order theory of the reals, with that of computing certain topological invariants of semi-algebraic sets. Even though we mostly concentrate on exact algorithms, we also discuss some numerical approaches involving semi-definite programming that have gained popularity in recent times.
Forward citations
Cited by 4 Pith papers
-
A certified classification of first-order controlled coaxial telescopes
For three-mirror coaxial telescopes, the first-order admissible solution set splits into finitely many connected components, each named uniquely by a signature of magnification and curvature signs.
-
Probabilistic Strategy Logic with Degrees of Observability
The paper introduces oPSL, an extension of Probabilistic Strategy Logic with observability and degree-of-observability operators, and claims a decidable model checking problem with 3EXPSPACE complexity.
-
Pure D-brane Black Holes: BPS Counting and non-BPS Vacua
The (1,1,1,5) and (1,1,1,6) D2-D2-D2-D6 BPS systems yield 2032 and 5616 vacua, matching U-duality, while the analogous non-BPS system has no zero-energy vacua and six doubly-degenerate low-energy minima.
-
Symbolic Computation with Symmetric Polynomials in Real Algebraic Geometry
A survey of algorithms that exploit permutation symmetry to speed up computations in real algebraic geometry.
Discussion (0). Continue with ORCID to comment.