On the public citation graph

Computing Rational Points in Convex Semialgebraic Sets and Sum of Squares Decompositions

0 signed · 42 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-13345-3_40openalex-snapshot
Factorization of univariate integer polynomials by diophantine approximation and an improved basis reduction algorithm
inferredcites →https://doi.org/10.1007/978-3-662-05355-3openalex-snapshot
Algorithms in Real Algebraic Geometry
inferredcites →https://doi.org/10.1007/978-3-7091-7551-4_16openalex-snapshot
Some Useful Bounds
inferredcites →https://doi.org/10.1007/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
inferredcites →https://doi.org/10.1007/pl00009496openalex-snapshot
Integer Optimization on Convex Semialgebraic Sets
inferredcites →https://doi.org/10.1016/j.jco.2005.04.004openalex-snapshot
Complexity of integer quasiconvex polynomial optimization
inferredcites →https://doi.org/10.1016/j.jsc.2011.08.002openalex-snapshot
Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients
inferredcites →https://doi.org/10.1016/j.tcs.2008.09.025openalex-snapshot
Computing sum of squares decompositions with rational coefficients
inferredcites →https://doi.org/10.1016/s0022-4049(97)83827-3openalex-snapshot
An algorithm for sums of squares of real polynomials
inferredcites →https://doi.org/10.1023/a:1008203903341openalex-snapshot
On the Complexity of Semidefinite Programs
inferredcites →https://doi.org/10.1090/pspum/058.2/1327293openalex-snapshot
Sums of squares of real polynomials
inferredcites →https://doi.org/10.1090/s0002-9939-08-09641-xopenalex-snapshot
Sums of squares over totally real fields are rational sums of squares
inferredcites →https://doi.org/10.1137/s0895479899352689openalex-snapshot
Polynomial Instances of the Positive Semidefinite and Euclidean Distance Matrix Completion Problems
inferredcites →https://doi.org/10.1145/1277500.1277534openalex-snapshot
A Macaulay 2 package for computing sum of squares decompositions of polynomials with rational coefficients
inferredcites →https://doi.org/10.1145/1390768.1390792openalex-snapshot
Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars
inferredcites →https://doi.org/10.1145/235809.235813openalex-snapshot
On the combinatorial and algebraic complexity of quantifier elimination
inferredcites →https://doi.org/10.1287/moor.8.4.538openalex-snapshot
Integer Programming with a Fixed Number of Variables
inferredcites →https://doi.org/10.5860/choice.51-3296openalex-snapshot
Real algebraic geometry

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-319-66320-3_6openalex-snapshot
Certifying Simple Zeros of Over-Determined Polynomial Systems
inferred← citeshttps://doi.org/10.1007/s00332-017-9421-2openalex-snapshot
Bounding Averages Rigorously Using Semidefinite Programming: Mean Moments of the Lorenz System
inferred← citeshttps://doi.org/10.1016/j.jsc.2017.03.004openalex-snapshot
Certifying solutions to overdetermined and singular polynomial systems over Q
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/j.jsc.2018.06.005openalex-snapshot
Algorithms for weighted sum of squares decomposition of non-negative univariate polynomials
inferred← citeshttps://doi.org/10.1016/j.jsc.2020.11.001openalex-snapshot
Exact Algorithms for Semidefinite Programs with Degenerate Feasible Set
inferred← citeshttps://doi.org/10.1016/j.jsc.2021.03.005openalex-snapshot
On exact Reznick, Hilbert-Artin and Putinar's representations
inferred← citeshttps://doi.org/10.1109/tac.2017.2717941openalex-snapshot
Algebraic Certificates of (Semi)Definiteness for Polynomials Over Fields Containing the Rationals
inferred← citeshttps://doi.org/10.1137/130931308openalex-snapshot
Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set
inferred← citeshttps://doi.org/10.1137/15m1036543openalex-snapshot
Exact Algorithms for Linear Matrix Inequalities
inferred← citeshttps://doi.org/10.1137/21m1436245openalex-snapshot
Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients
inferred← citeshttps://doi.org/10.1145/1993886.1993910openalex-snapshot
Deciding reachability of the infimum of a multivariate polynomial
inferred← citeshttps://doi.org/10.1145/2442829.2442859openalex-snapshot
Certificates of impossibility of Hilbert-Artin representations of a given degree for definite polynomials and functions
inferred← citeshttps://doi.org/10.1145/2465506.2465949openalex-snapshot
Computing rational solutions of linear matrix inequalities
inferred← citeshttps://doi.org/10.1145/2755996.2756666openalex-snapshot
Optimizing a Parametric Linear Function over a Non-compact Real Algebraic Variety
inferred← citeshttps://doi.org/10.1145/3208976.3208986openalex-snapshot
On Exact Polya and Putinar's Representations
inferred← citeshttps://doi.org/10.1145/3326229.3326262openalex-snapshot
Computing the Volume of Compact Semi-Algebraic Sets
inferred← citeshttps://doi.org/10.3390/math6090166openalex-snapshot
A Heuristic Method for Certifying Isolated Zeros of Polynomial Systems
inferred← citeshttps://doi.org/10.4171/jems/620openalex-snapshot
Sums of squares of polynomials with rational coefficients
inferred← citeshttps://doi.org/10.48550/arxiv.1408.2721openalex-snapshot
Certifying solutions to overdetermined and singular polynomial systems over Q
inferred← citeshttps://doi.org/10.48550/arxiv.1706.03941openalex-snapshot
Algorithms for Weighted Sums of Squares Decomposition of Non-negative Univariate Polynomials
inferred← citeshttps://doi.org/10.48550/arxiv.1904.11705openalex-snapshot
Computing the volume of compact semi-algebraic sets
inferred← citeshttps://doi.org/10.5802/ccirm.17openalex-snapshot
Optimization on linear matrix inequalities for polynomial systems control
inferred← citeshttps://doi.org/10.70675/20c4db5az6bf5z4d03za9d9z5e6cd5011246openalex-snapshot
Certified Polynomial Optimization Based on Exact Sum of Squares Decompositions
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.