On the public citation graph

On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae

0 signed · 56 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-07407-4_17openalex-snapshot
Quantifier elimination for real closed fields by cylindrical algebraic decompostion
inferredcites →https://doi.org/10.1016/0020-0190(84)90018-8openalex-snapshot
On computing the determinant in small parallel time using a small number of processors
inferredcites →https://doi.org/10.1016/0304-3975(81)90064-5openalex-snapshot
Resolution des systemes d'equations algebriques
inferredcites →https://doi.org/10.1016/0885-064x(87)90022-7openalex-snapshot
On the worst-case arithmetic complexity of approximating zeros of polynomials
inferredcites →https://doi.org/10.1016/s0019-9958(82)90766-5openalex-snapshot
Fast parallel matrix and GCD computations
inferredcites →https://doi.org/10.1016/s0022-0000(05)80061-3openalex-snapshot
Specified precision polynomial root isolation is in NC
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.1016/s0747-7171(88)80008-7openalex-snapshot
Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
inferredcites →https://doi.org/10.1090/dimacs/006/20openalex-snapshot
Recent progress on the complexity of the decision problem for the reals
inferredcites →https://doi.org/10.1090/s0273-0979-1989-15750-9openalex-snapshot
On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
inferredcites →https://doi.org/10.1137/0205040openalex-snapshot
Fast Parallel Matrix Inversion Algorithms
inferredcites →https://doi.org/10.1137/0218024openalex-snapshot
On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials
inferredcites →https://doi.org/10.1145/321662.321665openalex-snapshot
On Euclid's Algorithm and the Theory of Subresultants
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/jcom.1994.1001openalex-snapshot
Is It Possible to Know a Problem Instance Is Ill-Posed?
inferred← citeshttps://doi.org/10.1007/11839132_8openalex-snapshot
Approximation Classes for Real Number Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-1-4612-2740-3_33openalex-snapshot
Ill-Posed Problem Instances
inferred← citeshttps://doi.org/10.1007/978-1-4614-1927-3_19openalex-snapshot
On the Complexity of Nonlinear Mixed-Integer Optimization
inferred← citeshttps://doi.org/10.1007/978-3-032-10503-5_5openalex-snapshot
The Existential Theory of the Reals as a Complexity Class: A Compendium
inferred← citeshttps://doi.org/10.1007/978-3-540-68279-0_15openalex-snapshot
Nonlinear Integer Programming
inferred← citeshttps://doi.org/10.1007/bf01182622openalex-snapshot
Analytical solutions to the optimization of a quadratic cost function subject to linear and quadratic equality constraints
inferred← citeshttps://doi.org/10.1007/pl00009496openalex-snapshot
Integer Optimization on Convex Semialgebraic Sets
inferred← citeshttps://doi.org/10.1007/s10107-007-0175-8openalex-snapshot
FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension
inferred← citeshttps://doi.org/10.1007/s10107-022-01818-3openalex-snapshot
Complexity, exactness, and rationality in polynomial optimization
inferred← citeshttps://doi.org/10.1007/s10479-018-3111-9openalex-snapshot
Approximation schemes for r-weighted Minimization Knapsack problems
inferred← citeshttps://doi.org/10.1016/j.camwa.2005.02.015openalex-snapshot
Computation of equilibriain noncooperative games
inferred← citeshttps://doi.org/10.1016/j.dam.2011.06.029openalex-snapshot
8th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009)
inferred← citeshttps://doi.org/10.1016/j.jco.2005.04.004openalex-snapshot
Complexity of integer quasiconvex polynomial optimization
inferred← citeshttps://doi.org/10.1016/j.jco.2025.101979openalex-snapshot
On the complexity of p-order cone programs
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80061-3openalex-snapshot
Specified precision polynomial root isolation is in NC
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1023/a:1008203903341openalex-snapshot
On the Complexity of Semidefinite Programs
inferred← citeshttps://doi.org/10.1023/a:1019199917103openalex-snapshot
Design, analysis, and implementation of a multiprecision polynomial rootfinder
inferred← citeshttps://doi.org/10.1080/10556788.2018.1528249openalex-snapshot
Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity
inferred← citeshttps://doi.org/10.1109/fscs.1990.89534openalex-snapshot
Specified precision polynomial root isolation is in NC
inferred← citeshttps://doi.org/10.1109/sfcs.1997.646105openalex-snapshot
Computing integral points in convex semi-algebraic sets
inferred← citeshttps://doi.org/10.1137/1.9781611973075.73openalex-snapshot
Geometric optimization and sums of algebraic functions
inferred← citeshttps://doi.org/10.1137/140990139openalex-snapshot
An Almost Optimal Algorithm for Computing Nonnegative Rank
inferred← citeshttps://doi.org/10.1137/21m1419933openalex-snapshot
On the Central Path of Semidefinite Optimization: Degree and Worst-Case Convergence Rate
inferred← citeshttps://doi.org/10.1145/237661.237672openalex-snapshot
Towards practical constraint databases (extended abstract)
inferred← citeshttps://doi.org/10.1145/2532647openalex-snapshot
Geometric optimization and sums of algebraic functions
inferred← citeshttps://doi.org/10.1145/2755996.2756683openalex-snapshot
Nonnegative Matrix Factorization
inferred← citeshttps://doi.org/10.1145/2897518.2897639openalex-snapshot
Weighted low rank approximations with provable guarantees
inferred← citeshttps://doi.org/10.1145/3802807.3802814openalex-snapshot
The QMA(2) UniverseComplexity, Entanglement, and Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1205.0044openalex-snapshot
A Singly-Exponential Time Algorithm for Computing Nonnegative Rank
inferred← citeshttps://doi.org/10.48550/arxiv.1506.01367openalex-snapshot
A Nearly Optimal and Agnostic Algorithm for Properly Learning a Mixture of k Gaussians, for any Constant k
inferred← citeshttps://doi.org/10.48550/arxiv.1511.04066openalex-snapshot
Properly Learning Poisson Binomial Distributions in Almost Polynomial Time
inferred← citeshttps://doi.org/10.48550/arxiv.1601.04118openalex-snapshot
Approximating the maximum of a polynomial over a polytope: Handelman decomposition and continuous generating functions
inferred← citeshttps://doi.org/10.48550/arxiv.1912.07673openalex-snapshot
Finding the Mode of a Kernel Density Estimate
inferred← citeshttps://doi.org/10.48550/arxiv.2106.15908openalex-snapshot
A Statistical Taylor Theorem and Extrapolation of Truncated Densities
inferred← citeshttps://doi.org/10.5555/2627817.2627921openalex-snapshot
An almost optimal algorithm for computing nonnegative rank
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.