On the public citation graph

Feasibility testing for systems of real quadratic equations

0 signed · 72 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-4684-9330-6openalex-snapshot
A Hilbert Space Problem Book
inferredcites →https://doi.org/10.1007/978-3-662-00061-8openalex-snapshot
Aufgaben und Lehrsätze aus der Analysis
inferredcites →https://doi.org/10.1007/978-3-662-38381-0openalex-snapshot
Aufgaben und Lehrsätze aus der Analysis
inferredcites →https://doi.org/10.1007/978-3-7091-7551-4_7openalex-snapshot
Real Zeros of Polynomials
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/bf02133177openalex-snapshot
Topology of quadratic maps and hessians of smooth maps
inferredcites →https://doi.org/10.1016/0021-8693(88)90166-4openalex-snapshot
The diagonal of a D-finite power series is D-finite
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.1145/1089310.1089312openalex-snapshot
Computer algebra symbolic and algebraic computation
inferredcites →https://doi.org/10.1145/129712.129725openalex-snapshot
Feasibility testing for systems of real quadratic equations
inferredcites →https://doi.org/10.2307/2323760openalex-snapshot
A Hilbert Space Problem Book.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0413openalex-snapshot
Integer Programming Duality
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_271openalex-snapshot
Matrix Completion Problems
inferred← citeshttps://doi.org/10.1007/0-387-22444-0_6openalex-snapshot
Semidefinite Programs and Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_355openalex-snapshot
Matrix Completion Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-45771-6_32openalex-snapshot
On Convex Hulls of Epigraphs of QCQPs
inferred← citeshttps://doi.org/10.1007/978-3-030-73879-2_5openalex-snapshot
Complexity, Exactness, and Rationality in Polynomial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-030-86433-0_14openalex-snapshot
Continuous Reformulation of Binary Variables, Revisited
inferred← citeshttps://doi.org/10.1007/pl00004896openalex-snapshot
Polar varieties and efficient real elimination
inferred← citeshttps://doi.org/10.1007/s00454-007-9001-6openalex-snapshot
A Sharper Estimate on the Betti Numbers of Sets Defined by Quadratic Inequalities
inferred← citeshttps://doi.org/10.1007/s00454-007-9014-1openalex-snapshot
On Projections of Semi-Algebraic Sets Defined by Few Quadratic Inequalities
inferred← citeshttps://doi.org/10.1007/s00454-023-00550-9openalex-snapshot
Integrating Products of Quadratic Forms
inferred← citeshttps://doi.org/10.1007/s10107-020-01589-9openalex-snapshot
On the tightness of SDP relaxations of QCQPs
inferred← citeshttps://doi.org/10.1007/s10107-022-01818-3openalex-snapshot
Complexity, exactness, and rationality in polynomial optimization
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-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-014-9222-zopenalex-snapshot
A Complexity Theory of Constructible Functions and Sheaves
inferred← citeshttps://doi.org/10.1007/s10957-022-02064-5openalex-snapshot
Solving Two-Trust-Region Subproblems Using Semidefinite Optimization with Eigenvector Branching
inferred← citeshttps://doi.org/10.1007/s40305-019-00286-5openalex-snapshot
A Survey of Hidden Convex Optimization
inferred← citeshttps://doi.org/10.1016/j.aim.2016.09.015openalex-snapshot
Bounding the equivariant Betti numbers of symmetric semi-algebraic sets
inferred← citeshttps://doi.org/10.1016/j.aim.2022.108391openalex-snapshot
When a system of real quadratic equations has a solution
inferred← citeshttps://doi.org/10.1016/j.artint.2021.103524openalex-snapshot
Deciding Koopman's qualitative probability
inferred← citeshttps://doi.org/10.1016/j.ejco.2021.100012openalex-snapshot
(Global) Optimization: Historical notes and recent developments
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.jsc.2017.08.001openalex-snapshot
Bit complexity for multi-homogeneous polynomial system solving—Application to polynomial minimization
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)12008-8openalex-snapshot
Semidefinite Programming and Integer Programming
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.1112/plms/pdn031openalex-snapshot
Bounding the number of stable homotopy types of a parametrized family of semi-algebraic sets defined by quadratic inequalities
inferred← citeshttps://doi.org/10.1137/130936294openalex-snapshot
On the Complexity of Computing Critical Points with Gröbner Bases
inferred← citeshttps://doi.org/10.1137/130945880openalex-snapshot
A Two-Variable Approach to the Two-Trust-Region Subproblem
inferred← citeshttps://doi.org/10.1137/15100624xopenalex-snapshot
Solving Generalized CDT Problems via Two-Parameter Eigenvalues
inferred← citeshttps://doi.org/10.1137/15m1009871openalex-snapshot
A Note on Polynomial Solvability of the CDT Problem
inferred← citeshttps://doi.org/10.1137/16m1078859openalex-snapshot
Kronecker Product Constraints with an Application to the Two-Trust-Region Subproblem
inferred← citeshttps://doi.org/10.1137/16m1080082openalex-snapshot
New Results on Narrowing the Duality Gap of the Extended Celis--Dennis--Tapia Problem
inferred← citeshttps://doi.org/10.1137/18m1164639openalex-snapshot
A Linear-Time Algorithm for Globally Maximizing the Sum of a Generalized Rayleigh Quotient and a Quadratic Form on the Unit Sphere
inferred← citeshttps://doi.org/10.1137/21m1428583openalex-snapshot
On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations
inferred← citeshttps://doi.org/10.1137/21m1434945openalex-snapshot
How Do Exponential Size Solutions Arise in Semidefinite Programming?
inferred← citeshttps://doi.org/10.1137/21m144548xopenalex-snapshot
Sharp and Fast Bounds for the Celis-Dennis-Tapia Problem
inferred← citeshttps://doi.org/10.1137/24m164255xopenalex-snapshot
On Spectral and Nuclear Norms of Order Three Tensors with One Fixed Dimension
inferred← citeshttps://doi.org/10.1137/24m1674984openalex-snapshot
A QP1QC Approach for Deciding Whether or Not Two Quadratic Surfaces Intersect
inferred← citeshttps://doi.org/10.1137/s003614450444614xopenalex-snapshot
A Survey of the S-Lemma
inferred← citeshttps://doi.org/10.1137/s0895479899352689openalex-snapshot
Polynomial Instances of the Positive Semidefinite and Euclidean Distance Matrix Completion Problems
inferred← citeshttps://doi.org/10.1137/s1052623401395899openalex-snapshot
Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation
inferred← citeshttps://doi.org/10.1145/1060590.1060637openalex-snapshot
Polynomial time algorithm for computing the top Betti numbers of semi-algebraic sets defined by quadratic inequalities
inferred← citeshttps://doi.org/10.1145/2442829.2442855openalex-snapshot
Critical points and Gröbner bases
inferred← citeshttps://doi.org/10.1145/2512329openalex-snapshot
Most Tensor Problems Are NP-Hard
inferred← citeshttps://doi.org/10.1145/3208976.3209023openalex-snapshot
Real Root Finding for Equivariant Semi-algebraic Systems
inferred← citeshttps://doi.org/10.1287/educ.2021.0232openalex-snapshot
Exactness in Semidefinite Progam Relaxations of Quadratically Constrained Quadratic Programs: Theory and Applications
inferred← citeshttps://doi.org/10.17077/etd.wvkyfp48openalex-snapshot
A conic optimization approach to variants of the trust region subproblem
inferred← citeshttps://doi.org/10.2139/ssrn.7206341openalex-snapshot
Two Cubic Equations over the Reals: Generic Solvability and ∃R-Completeness
inferred← citeshttps://doi.org/10.3390/sym13091719openalex-snapshot
Infinitesimal Periodic Deformations and Quadrics
inferred← citeshttps://doi.org/10.4171/jems/208openalex-snapshot
Bounding the Betti numbers and computing the Euler–Poincaré characteristic of semi-algebraic sets defined by partly quadratic systems of polynomials
inferred← citeshttps://doi.org/10.48550/arxiv.1202.1411openalex-snapshot
Observer design for systems with an energy-preserving non-linearity
inferred← citeshttps://doi.org/10.48550/arxiv.1406.6429openalex-snapshot
A note on polynomial solvability of the CDT problem
inferred← citeshttps://doi.org/10.48550/arxiv.1409.1534openalex-snapshot
Algorithms in Real Algebraic Geometry: A Survey
inferred← citeshttps://doi.org/10.48550/arxiv.2006.09221openalex-snapshot
Testing systems of real quadratic equations for approximate solutions
inferred← citeshttps://doi.org/10.48550/arxiv.2102.13220openalex-snapshot
Semidefinite Relaxations of Products of Nonnegative Forms on the Sphere
inferred← citeshttps://doi.org/10.48550/arxiv.2107.06885openalex-snapshot
Exactness in SDP relaxations of QCQPs: Theory and applications
inferred← citeshttps://doi.org/10.48550/arxiv.math/0411107openalex-snapshot
First Steps in Algorithmic Fewnomial Theory
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.