On the public citation graph

Finding connected components of a semialgebraic set in subexponential time

https://doi.org/10.1007/bf01614146
0 signed · 43 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

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-0441-1_33openalex-snapshot
Deciding Consistency of Systems of Polynomial in Exponent Inequalities in Subexponential Time
inferredcites →https://doi.org/10.1007/978-3-642-57956-1openalex-snapshot
Basic Algebraic Geometry 2
inferredcites →https://doi.org/10.1007/978-3-642-67821-9openalex-snapshot
Lectures on Algebraic Topology
inferredcites →https://doi.org/10.1007/978-3-642-96200-4openalex-snapshot
Basic Algebraic Geometry
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/bf01202001openalex-snapshot
Counting connected components of a semialgebraic set in subexponential time
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.1525/9780520348097openalex-snapshot
A Decision Method for Elementary Algebra and Geometry
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.1006/jsco.2000.0393openalex-snapshot
Proper Parametrization of Real Tubular Surfaces
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-54195-0_35openalex-snapshot
Geometric problems solvable in single exponential time
inferred← citeshttps://doi.org/10.1007/3-540-54522-0_100openalex-snapshot
An improved sign determination algorithm
inferred← citeshttps://doi.org/10.1007/3-540-54522-0_117openalex-snapshot
Complexity of the computation of the canonical Whitney stratification of an algebraic set in Cn
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/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-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/bf01200148openalex-snapshot
Construction of roadmaps in semi-algebraic sets
inferred← citeshttps://doi.org/10.1007/bf01202001openalex-snapshot
Counting 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/bfb0084637openalex-snapshot
Effective stratification of regular real algebraic varieties
inferred← citeshttps://doi.org/10.1007/pl00009335openalex-snapshot
The Complexity of Stratification Computation
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/s10208-019-09418-yopenalex-snapshot
Computing the Homology of Semialgebraic Sets. I: Lax Formulas
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.1090/conm/453/08799openalex-snapshot
Algorithmic semi-algebraic geometry and topology—recent progress and open problems
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/time.2000.856590openalex-snapshot
Towards a theory of movie database queries
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/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.1145/3815436.3815466openalex-snapshot
Computing the Connected Components of Real Algebraic Curves
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.