On the public citation graph

Finding irreducible components of some real transcendental varieties

https://doi.org/10.1007/bf01202285
0 signed · 28 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/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-1-4612-2628-4openalex-snapshot
Algebraic geometry and its applications: collections of papers from Shreeram S. Abhyankar's 60th birthday Conference
inferredcites →https://doi.org/10.1007/978-1-4612-2972-8_31openalex-snapshot
Elementary Structure of Real Algebraic Varieties
inferredcites →https://doi.org/10.1007/978-1-4757-3849-0openalex-snapshot
Algebraic Geometry
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-96200-4openalex-snapshot
Basic Algebraic Geometry
inferredcites →https://doi.org/10.1007/bf01095638openalex-snapshot
Factorization of polynomials over a finite field and the solution of systems of algebraic equations
inferredcites →https://doi.org/10.1007/bf01095643openalex-snapshot
Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
inferredcites →https://doi.org/10.1007/bf01810297openalex-snapshot
Computing the irreducible real factors and components of an algebraic curve
inferredcites →https://doi.org/10.1016/0001-8708(78)90082-8openalex-snapshot
Applied non-standard analysis
inferredcites →https://doi.org/10.1016/s0747-7171(08)80088-0openalex-snapshot
The complexity of deciding consistency of systems of polynomials in exponent inequalities
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)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.2307/1969908openalex-snapshot
Elementary Structure of Real Algebraic Varieties
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/bf02770873openalex-snapshot
Lower bound on testing membership to a polyhedron by algebraic decision and computation trees
inferred← citeshttps://doi.org/10.1007/s00200-022-00545-8openalex-snapshot
Decision problem for a class of univariate Pfaffian functions
inferred← citeshttps://doi.org/10.1007/s002090100287openalex-snapshot
The complexification and degree of a semi-algebraic set
inferred← citeshttps://doi.org/10.1007/s40598-017-0073-yopenalex-snapshot
On Irreducible Components of Real Exponential Hypersurfaces
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00159-xopenalex-snapshot
Complexity lower bounds for computation trees with elementary transcendental function gates
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2015.11.050openalex-snapshot
Zero counting for a class of univariate Pfaffian functions
inferred← citeshttps://doi.org/10.1017/fms.2025.10150openalex-snapshot
Partitioning theorems for sets of semi-Pfaffian sets, with applications
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/sfcs.1995.492481openalex-snapshot
Improved lower bound 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/236869.236891openalex-snapshot
Computing the complexification of a semi-algebraic set
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.