On the public citation graph
Description of the connected components of a semialgebraic set in single exponential time
0 signed · 58 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-07407-4_17openalex-snapshot
Quantifier elimination for real closed fields by cylindrical algebraic decompostion
inferredcites →https://doi.org/10.1007/3-540-07805-3_10openalex-snapshot
IX. Ein Entscheidungsverfahren für die Theorie der reell-abgeschlossenen Körper
inferredcites →https://doi.org/10.1007/3-540-54195-0_50openalex-snapshot
Single exponential path finding in semialgebraic sets Part I: The case of a regular bounded hypersurface
inferredcites →https://doi.org/10.1007/978-1-4612-2628-4_28openalex-snapshot
Single Exponential Path Finding in Semi-algebraic Sets, Part II: The General Case
inferredcites →https://doi.org/10.1007/bf01200148openalex-snapshot
Construction of roadmaps in semi-algebraic sets
inferredcites →https://doi.org/10.1007/bf01202001openalex-snapshot
Counting connected components of a semialgebraic set in subexponential time
inferredcites →https://doi.org/10.1007/bf01614146openalex-snapshot
Finding connected components of a semialgebraic set in subexponential time
inferredcites →https://doi.org/10.1007/bfb0016236openalex-snapshot
Parallel arithmetic computations: A survey
inferredcites →https://doi.org/10.1016/0196-8858(83)90014-3openalex-snapshot
On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds
inferredcites →https://doi.org/10.1016/s0747-7171(10)80003-3openalex-snapshot
On the computational complexity and geometry of the first-order theory of the reals. Part I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
inferredcites →https://doi.org/10.1016/s0747-7171(10)80004-5openalex-snapshot
On the computational complexity and geometry of the first-order theory of the reals. Part II: The general decision problem. Preliminaries for quantifier elimination
inferredcites →https://doi.org/10.1016/s0747-7171(10)80005-7openalex-snapshot
On the computational complexity and geometry of the first-order theory of the reals. Part III: Quantifier elimination
inferredcites →https://doi.org/10.1016/s0747-7171(88)80005-1openalex-snapshot
Solving systems of polynomial inequalities in subexponential time
inferredcites →https://doi.org/10.1016/s0747-7171(88)80006-3openalex-snapshot
Complexity of deciding Tarski algebra
inferredcites →https://doi.org/10.1145/62212.62257openalex-snapshot
Some algebraic and geometric computations in PSPACE
inferredcites →https://doi.org/10.24033/bsmf.2138openalex-snapshot
Sur la complexité du principe de Tarski-Seidenberg
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-33099-2_17openalex-snapshot
Computing Roadmaps and Connected Components of Semi-algebraic Sets
inferred← citeshttps://doi.org/10.1007/3-540-44543-9_14openalex-snapshot
Expressing topological connectivity of spatial databases
inferred← citeshttps://doi.org/10.1007/978-1-4020-5587-4_13openalex-snapshot
Real Algebraic Geometry and Constraint Databases
inferred← citeshttps://doi.org/10.1007/978-1-4612-2628-4_28openalex-snapshot
Single Exponential Path Finding in Semi-algebraic Sets, Part II: The General Case
inferred← citeshttps://doi.org/10.1007/978-3-540-45072-6_20openalex-snapshot
Region-Based Query Languages for Spatial Databases in the Topological Data Model
inferred← citeshttps://doi.org/10.1007/978-3-642-13411-1_5openalex-snapshot
An Efficient Algorithm for the Sign Condition Problem in the Semi-algebraic Context
inferred← citeshttps://doi.org/10.1007/978-3-662-05355-3_17openalex-snapshot
Computing Roadmaps and Connected Components of Semi-algebraic Sets
inferred← citeshttps://doi.org/10.1007/pl00009443openalex-snapshot
On Bounding the Betti Numbers and Computing the Euler Characteristic of Semi-Algebraic Sets
inferred← citeshttps://doi.org/10.1007/s00037-005-0190-1openalex-snapshot
Computing the euler–poincaré characteristics of sign conditions
inferred← citeshttps://doi.org/10.1007/s10208-005-0208-8openalex-snapshot
Computing the Top Betti Numbers of Semialgebraic Sets Defined by Quadratic Inequalities in Polynomial Time
inferred← citeshttps://doi.org/10.1007/s10208-007-9001-1openalex-snapshot
Computing the First Betti Number of a Semi-Algebraic Set
inferred← citeshttps://doi.org/10.1007/s10208-008-9033-1openalex-snapshot
Errata for Computing the Top Betti Numbers of Semialgebraic Sets Defined by Quadratic Inequalities in Polynomial Time
inferred← citeshttps://doi.org/10.1007/s10440-012-9782-3openalex-snapshot
Numerically Computing Real Points on Algebraic Sets
inferred← citeshttps://doi.org/10.1007/s10958-006-0111-0openalex-snapshot
Computing the dimension of a semi-algebraic set
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50003-6openalex-snapshot
Arrangements and Their Applications**Work by PA. was supported by Army Research Office MURI grant DAAH04-96-1-0013, by a Sloan fellowship, by an NYI award, and by a grant from the U.S.–Israeli Binational Science Foundation. Work by M.S. was supported by NSF Grants CCR-91-22103 and CCR-93-11127, by…
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2008.09.043openalex-snapshot
Computing the Betti numbers of semi-algebraic sets defined by partly quadratic systems of polynomials
inferred← citeshttps://doi.org/10.1016/j.jco.2005.11.001openalex-snapshot
Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets
inferred← citeshttps://doi.org/10.1016/j.jsc.2006.07.001openalex-snapshot
Computing the first few Betti numbers of semi-algebraic sets in single exponential time
inferred← citeshttps://doi.org/10.1016/j.jsc.2022.09.003openalex-snapshot
Smooth points on semi-algebraic sets
inferred← citeshttps://doi.org/10.1016/s0022-0000(02)00034-xopenalex-snapshot
Reachability and connectivity queries in constraint databases
inferred← citeshttps://doi.org/10.1090/conm/453/08799openalex-snapshot
Algorithmic semi-algebraic geometry and topology—recent progress and open problems
inferred← citeshttps://doi.org/10.1109/time.2000.856590openalex-snapshot
Towards a theory of movie database queries
inferred← citeshttps://doi.org/10.1137/15m1036543openalex-snapshot
Exact Algorithms for Linear Matrix Inequalities
inferred← citeshttps://doi.org/10.1145/1007352.1007425openalex-snapshot
Counting complexity classes for numeric computations II
inferred← citeshttps://doi.org/10.1145/1060590.1060636openalex-snapshot
Computing the first Betti number and the connected components of semi-algebraic sets
inferred← citeshttps://doi.org/10.1145/237814.237988openalex-snapshot
On bounding the Betti numbers and computing the Euler characteristic of semi-algebraic sets
inferred← citeshttps://doi.org/10.1145/2465506.2465951openalex-snapshot
Verified error bounds for real solutions of positive-dimensional polynomial systems
inferred← citeshttps://doi.org/10.1145/281508.281528openalex-snapshot
Polytime algorithm for the shortest path in a homotopy class amidst semi-algebraic obstacles in the plane
inferred← citeshttps://doi.org/10.1145/281508.281533openalex-snapshot
Complexity of computing semi-algebraic descriptions of the connected components of a semi-algebraic set
inferred← citeshttps://doi.org/10.1145/2930889.2930927openalex-snapshot
Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems
inferred← citeshttps://doi.org/10.1145/2930889.2930929openalex-snapshot
Critical Point Computations on Smooth Varieties
inferred← citeshttps://doi.org/10.1145/320211.320240openalex-snapshot
New results on quantifier elimination over real closed fields and applications to constraint databases
inferred← citeshttps://doi.org/10.1145/335168.335213openalex-snapshot
Reachability and connectivity queries in constraint databases
inferred← citeshttps://doi.org/10.1145/3815436.3815466openalex-snapshot
Computing the Connected Components of Real Algebraic Curves
inferred← citeshttps://doi.org/10.17169/refubium-12725openalex-snapshot
Tracing-problems in dynamic geometry
inferred← citeshttps://doi.org/10.48550/arxiv.1105.6266openalex-snapshot
Numerically computing real points on algebraic sets
inferred← citeshttps://doi.org/10.48550/arxiv.1409.1534openalex-snapshot
Algorithms in Real Algebraic Geometry: A Survey
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0312007openalex-snapshot
Counting complexity classes for numeric computations II: algebraic and semialgebraic sets
inferred← citeshttps://doi.org/10.48550/arxiv.math/0603248openalex-snapshot
Computing the First Betti Numberand Describing the Connected Components of Semi-algebraic Sets
inferred← citeshttps://doi.org/10.70675/0d61eb7fz57f8z4d4ezbda2zea2637bc58bfopenalex-snapshot
Modeling and qualitative simulation of hybrid systems
inferred← citeshttps://doi.org/10.70675/2e9d6fe2z1705z4204zbbaezea86f5846d60openalex-snapshot
Exact algorithms for determinantal varieties and semidefinite programming
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.