Pith. sign in

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

arxiv 1409.1534 v1 pith:L5ZPN5UQ submitted 2014-09-04 math.AG cs.CCcs.CGcs.SC

classification math.AGcs.CCcs.CGcs.SC
keywords algorithmsrecenttheoryalgebraiccomputationalcomputingdiscussfirst
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A certified classification of first-order controlled coaxial telescopes

    astro-ph.IM 2024-12 conditional novelty 7.0 of 10

    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.

  2. Probabilistic Strategy Logic with Degrees of Observability

    cs.AI 2024-12 reject novelty 6.0 of 10

    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.

  3. Pure D-brane Black Holes: BPS Counting and non-BPS Vacua

    hep-th 2026-01 conditional novelty 5.0 of 10

    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.

  4. Symbolic Computation with Symmetric Polynomials in Real Algebraic Geometry

    math.AG 2025-07 conditional

    A survey of algorithms that exploit permutation symmetry to speed up computations in real algebraic geometry.

Pith tools