On the public citation graph
Counting connected components of a semialgebraic set in subexponential time
0 signed · 92 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-3-642-67821-9openalex-snapshot
Lectures on Algebraic Topology
inferredcites →https://doi.org/10.1007/978-3-662-00756-3openalex-snapshot
Lectures on Algebraic Topology
inferredcites →https://doi.org/10.1007/978-3-7091-9459-1_3openalex-snapshot
A Decision Method for Elementary Algebra and Geometry
inferredcites →https://doi.org/10.1007/978-3-7091-9459-1_4openalex-snapshot
Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition
inferredcites →https://doi.org/10.1007/bf01614146openalex-snapshot
Finding connected components of a semialgebraic set in subexponential time
inferredcites →https://doi.org/10.1016/0022-0000(86)90029-2openalex-snapshot
The complexity of elementary algebra and geometry
inferredcites →https://doi.org/10.1016/0304-3975(83)90002-6openalex-snapshot
Definability and fast quantifier elimination in algebraically closed fields
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(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.1090/s0002-9939-1964-0161339-9openalex-snapshot
On the Betti Numbers of Real Varieties
inferredcites →https://doi.org/10.1525/9780520348097openalex-snapshot
A Decision Method for Elementary Algebra and Geometry
inferredcites →https://doi.org/10.2307/1969640openalex-snapshot
A New Decision Method for Elementary Algebra
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-54522-0_99openalex-snapshot
Computing roadmaps of general semi-algebraic sets
inferred← citeshttps://doi.org/10.1007/3-540-63163-1_9openalex-snapshot
Computing minimum-link path in a homotopy class amidst semi-algebraic obstacles in the plane
inferred← citeshttps://doi.org/10.1007/978-3-030-22996-2_1openalex-snapshot
Recent Advances in the Computation of the Homology of Semialgebraic Sets
inferred← citeshttps://doi.org/10.1007/978-3-031-82670-2_16openalex-snapshot
Pathways to Tractability for Geometric Thickness
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-642-60539-0_1openalex-snapshot
Computing Roadmaps of Semi-algebraic Sets on a Variety (Extended Abstract)
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/bf01200148openalex-snapshot
Construction of roadmaps in semi-algebraic sets
inferred← citeshttps://doi.org/10.1007/bf01614146openalex-snapshot
Finding connected components of a semialgebraic set in subexponential time
inferred← citeshttps://doi.org/10.1007/bf02573999openalex-snapshot
Description of the connected components of a semialgebraic set in single exponential time
inferred← citeshttps://doi.org/10.1007/bf02770873openalex-snapshot
Lower bound on testing membership to a polyhedron by algebraic decision and computation trees
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/s00200-007-0052-yopenalex-snapshot
Testing elementary function identities using CAD
inferred← citeshttps://doi.org/10.1007/s00454-009-9200-4openalex-snapshot
On Sign Conditions Over Real Multivariate Polynomials
inferred← citeshttps://doi.org/10.1007/s00454-014-9610-9openalex-snapshot
Divide and Conquer Roadmap for Algebraic Sets
inferred← citeshttps://doi.org/10.1007/s00454-024-00626-0openalex-snapshot
Efficient Computation of a Semi-Algebraic Basis of the First Homology Group of a Semi-Algebraic Set
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/s10208-010-9062-4openalex-snapshot
Polynomial Hierarchy, Betti Numbers, and a Real Analogue of Toda’s Theorem
inferred← citeshttps://doi.org/10.1007/s10208-014-9212-1openalex-snapshot
A Baby Step–Giant Step Roadmap Algorithm for General Algebraic Sets
inferred← citeshttps://doi.org/10.1007/s10208-019-09418-yopenalex-snapshot
Computing the Homology of Semialgebraic Sets. I: Lax Formulas
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.1007/s11075-024-01952-3openalex-snapshot
Smooth connectivity in real algebraic varieties
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.entcs.2009.02.007openalex-snapshot
Hybrid Automata in Systems Biology: How Far Can We Go?
inferred← citeshttps://doi.org/10.1016/j.ic.2008.09.001openalex-snapshot
Inclusion dynamics hybrid automata
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.jco.2008.03.001openalex-snapshot
A numerical algorithm for zero counting, I: Complexity and accuracy
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/j.jsc.2023.102234openalex-snapshot
Computing roadmaps in unbounded smooth real algebraic sets I: Connectivity results
inferred← citeshttps://doi.org/10.1016/j.jsc.2025.102532openalex-snapshot
Computing roadmaps in unbounded smooth real algebraic sets II: Algorithm and complexity
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.12.015openalex-snapshot
Hybrid automata, reachability, and Systems Biology
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.03.035openalex-snapshot
Computing real witness points of positive dimensional polynomial systems
inferred← citeshttps://doi.org/10.1017/9781009701259.006openalex-snapshot
Betti Number Bounds, Applications and Algorithms
inferred← citeshttps://doi.org/10.1017/fms.2023.36openalex-snapshot
Efficient simplicial replacement of semialgebraic sets
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.1090/conm/697/14046openalex-snapshot
Efficient algorithms for computing the Euler-Poincaré characteristic of symmetric semi-algebraic sets
inferred← citeshttps://doi.org/10.1090/s0894-0347-99-00311-2openalex-snapshot
Computing roadmaps of semi-algebraic sets on a variety
inferred← citeshttps://doi.org/10.1109/focs.2009.70openalex-snapshot
Polynomial Hierarchy, Betti Numbers and a Real Analogue of Toda's Theorem
inferred← citeshttps://doi.org/10.1109/sfcs.1994.365728openalex-snapshot
On the combinatorial and algebraic complexity of quantifier elimination
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492481openalex-snapshot
Improved lower bound on testing membership to a polyhedron by algebraic decision trees
inferred← citeshttps://doi.org/10.1109/tac.2017.2694351openalex-snapshot
Underapproximating Backward Reachable Sets by Semialgebraic Sets
inferred← citeshttps://doi.org/10.1137/22m1494415openalex-snapshot
Persistent Homology of Semialgebraic Sets
inferred← citeshttps://doi.org/10.1145/1005285.1005292openalex-snapshot
A poly-algorithmic approach to simplifying elementary functions
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/1073884.1073892openalex-snapshot
Adherence is better than adjacency
inferred← citeshttps://doi.org/10.1145/195058.195418openalex-snapshot
Lower bounds on testing membership to a polyhedron by algebraic decision trees
inferred← citeshttps://doi.org/10.1145/235809.235813openalex-snapshot
On the combinatorial and algebraic complexity of quantifier elimination
inferred← citeshttps://doi.org/10.1145/237814.237857openalex-snapshot
Computing roadmaps of semi-algebraic sets (extended abstract)
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/2442829.2442831openalex-snapshot
Complexity of deciding connectivity in real 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/2465506.2465954openalex-snapshot
Finding points on real solution components and applications to differential 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/3275242openalex-snapshot
Computing the Homology of Basic Semialgebraic Sets in Weak Exponential Time
inferred← citeshttps://doi.org/10.1145/3666000.3669687openalex-snapshot
Connectivity in Symmetric Semi-Algebraic Sets
inferred← citeshttps://doi.org/10.48550/arxiv.1105.6266openalex-snapshot
Numerically computing real points on algebraic sets
inferred← citeshttps://doi.org/10.48550/arxiv.1201.6439openalex-snapshot
A baby step-giant step roadmap algorithm for general algebraic sets
inferred← citeshttps://doi.org/10.48550/arxiv.1405.7115openalex-snapshot
Geometric involutive bases for positive dimensional polynomial ideals and SDP methods
inferred← citeshttps://doi.org/10.48550/arxiv.1409.1534openalex-snapshot
Algorithms in Real Algebraic Geometry: A Survey
inferred← citeshttps://doi.org/10.48550/arxiv.2110.07409openalex-snapshot
The Geometry of Memoryless Stochastic Policy Optimization in Infinite-Horizon POMDPs
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.5281/zenodo.173866openalex-snapshot
FIGURE 9. The gel image Hin6I in Description of a new Fridericia species (Oligochaeta: Enchytraeidae) and its molecular comparison with two morphologically similar species by PCRRFLP
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.