On the public citation graph
Complexity of quantifier elimination in the theory of algebraically closed fields
0 signed · 133 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.
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.
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.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-10856-4_94openalex-snapshot
Multiplicative complexity of a bilinear form over a commutative ring
inferredcites →https://doi.org/10.1007/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
inferredcites →https://doi.org/10.1016/0304-3975(81)90064-5openalex-snapshot
Resolution des systemes d'equations algebriques
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.1109/sfcs.1982.56openalex-snapshot
A polynomial-time reduction from bivariate to univariate integral polynomial factorization
inferredcites →https://doi.org/10.1145/1089310.1089311openalex-snapshot
Polynomial reduction from multivariate to bivariate integral polynomial factorization
inferredcites →https://doi.org/10.1145/800061.808748openalex-snapshot
Factoring multivariate polynomials over finite fields
inferredcites →https://doi.org/10.1145/800070.802200openalex-snapshot
A polynomial reduction from multivariate to bivariate integral polynomial factorization.
inferredcites →https://doi.org/10.24033/bsmf.1848openalex-snapshot
Algèbre linéaire sur $K[X_1,\dots,X_n]$ et élimination
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/nla.2055openalex-snapshot
A nonconvex approach to low‐rank matrix completion using convex optimization
inferred← citeshttps://doi.org/10.1006/jsco.1998.0271openalex-snapshot
Solving Degenerate Sparse Polynomial Systems Faster
inferred← citeshttps://doi.org/10.1007/3-540-46541-3_3openalex-snapshot
Circuits versus Trees in Algebraic Complexity
inferred← citeshttps://doi.org/10.1007/3-540-51083-4_54openalex-snapshot
Some new effectivity bounds in computational geometry
inferred← citeshttps://doi.org/10.1007/3-540-51084-2_51openalex-snapshot
Complexity of computing the characters and the genre of a system of exterior differential equations
inferred← citeshttps://doi.org/10.1007/3-540-51517-8_81openalex-snapshot
Complexity of quantifier elimination in the theory of ordinary differential equations
inferred← citeshttps://doi.org/10.1007/3-540-56686-4_41openalex-snapshot
A zero-test and an interpolation algorithm for the shifted sparse polynomials
inferred← citeshttps://doi.org/10.1007/978-1-4612-0441-1_33openalex-snapshot
Deciding Consistency of Systems of Polynomial in Exponent Inequalities in Subexponential Time
inferred← citeshttps://doi.org/10.1007/978-3-032-01475-7_10openalex-snapshot
Checking whether Two Unambiguous Context-Free Grammars Describe the Same Set of Strings of Length n
inferred← citeshttps://doi.org/10.1007/978-3-032-34586-8_6openalex-snapshot
Pseudo-Complex Quantifier Elimination
inferred← citeshttps://doi.org/10.1007/978-3-319-02297-0_11openalex-snapshot
Polynomial Complexity of Solving Systems of Few Algebraic Equations with Small Degrees
inferred← citeshttps://doi.org/10.1007/978-3-319-24021-3_12openalex-snapshot
Computing Highest-Order Divisors for a Class of Quasi-Linear Partial Differential Equations
inferred← citeshttps://doi.org/10.1007/bf01543475openalex-snapshot
Computational complexity and constraint logic programming languages
inferred← citeshttps://doi.org/10.1007/bfb0017133openalex-snapshot
3-dimensional shortest paths in the presence of polyhedral obstacles
inferred← citeshttps://doi.org/10.1007/s00454-014-9571-zopenalex-snapshot
Elimination for Generic Sparse Polynomial Systems
inferred← citeshttps://doi.org/10.1007/s00607-010-0099-7openalex-snapshot
On computing absolutely irreducible components of algebraic varieties with parameters
inferred← citeshttps://doi.org/10.1007/s10208-005-0175-0openalex-snapshot
The Complexity of Computing the Hilbert Polynomial of Smooth Equidimensional Complex Projective Varieties
inferred← citeshttps://doi.org/10.1007/s10208-009-9045-5openalex-snapshot
Exact Matrix Completion via Convex Optimization
inferred← citeshttps://doi.org/10.1007/s10208-022-09599-zopenalex-snapshot
Counting Real Roots in Polynomial-Time via Diophantine Approximation
inferred← citeshttps://doi.org/10.1007/s10479-018-2885-0openalex-snapshot
Dealing with missing information in data envelopment analysis by means of low-rank matrix completion
inferred← citeshttps://doi.org/10.1007/s10559-012-9388-9openalex-snapshot
Arithmetic modeling of random processes and r-algorithms
inferred← citeshttps://doi.org/10.1007/s10958-006-0109-7openalex-snapshot
Complexity bound for the absolute factorization of parametric polynomials
inferred← citeshttps://doi.org/10.1007/s10958-011-0616-zopenalex-snapshot
Complexity of solving parametric polynomial systems
inferred← citeshttps://doi.org/10.1007/s11075-014-9876-2openalex-snapshot
A non-convex algorithm framework based on DC programming and DCA for matrix completion
inferred← citeshttps://doi.org/10.1007/s11222-020-09939-5openalex-snapshot
Matrix completion with nonconvex regularization: spectral operators and scalable algorithms
inferred← citeshttps://doi.org/10.1007/s11424-016-5040-5openalex-snapshot
A triangular decomposition algorithm for differential polynomial systems with elementary computation complexity
inferred← citeshttps://doi.org/10.1007/s11704-021-0136-zopenalex-snapshot
Dynamic road crime risk prediction with urban open data
inferred← citeshttps://doi.org/10.1007/s11786-020-00479-9openalex-snapshot
Efficiently and Effectively Recognizing Toricity of Steady State Varieties
inferred← citeshttps://doi.org/10.1007/s13042-017-0665-9openalex-snapshot
Low-rank matrix recovery via smooth rank function and its application in image restoration
inferred← citeshttps://doi.org/10.1007/s40314-025-03263-2openalex-snapshot
Approximation Newton method for low-rank matrix completion
inferred← citeshttps://doi.org/10.1016/0022-4049(90)90159-fopenalex-snapshot
Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields
inferred← citeshttps://doi.org/10.1016/0167-8396(89)90017-4openalex-snapshot
On computing the intersection of a pair of algebraic surfaces
inferred← citeshttps://doi.org/10.1016/j.aam.2010.03.006openalex-snapshot
On factoring parametric multivariate polynomials
inferred← citeshttps://doi.org/10.1016/j.acha.2024.101746openalex-snapshot
How robust is randomized blind deconvolution via nuclear norm minimization against adversarial noise?
inferred← citeshttps://doi.org/10.1016/j.ejor.2016.07.014openalex-snapshot
Matrix completion under interval uncertainty
inferred← citeshttps://doi.org/10.1016/j.jsc.2011.05.013openalex-snapshot
Properness defects of projection and minimal discriminant variety
inferred← citeshttps://doi.org/10.1016/j.neucom.2016.11.068openalex-snapshot
Fast smooth rank function approximation based on matrix tri-factorization
inferred← citeshttps://doi.org/10.1016/j.optcom.2014.04.077openalex-snapshot
Limited-angle reverse helical cone-beam CT for pipeline with low rank decomposition
inferred← citeshttps://doi.org/10.1016/s0022-4049(97)00068-6openalex-snapshot
An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80034-xopenalex-snapshot
Complexity of factoring and calculating the GCD of linear ordinary differential operators
inferred← citeshttps://doi.org/10.1016/s0747-7171(08)80088-0openalex-snapshot
The complexity of deciding consistency of systems of polynomials in exponent inequalities
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.1016/s0747-7171(86)80025-6openalex-snapshot
Computer Algebra: Past and Future
inferred← citeshttps://doi.org/10.1016/s0747-7171(88)80005-1openalex-snapshot
Solving systems of polynomial inequalities in subexponential time
inferred← citeshttps://doi.org/10.1016/s0747-7171(88)80006-3openalex-snapshot
Complexity of deciding Tarski algebra
inferred← citeshttps://doi.org/10.1080/02331934.2020.1823387openalex-snapshot
Exploiting low-rank structure in semidefinite programming by approximate operator splitting
inferred← citeshttps://doi.org/10.1080/23799927.2024.2309485openalex-snapshot
Digital signature schemes using non-square matrices or scrap automorphisms
inferred← citeshttps://doi.org/10.1088/0266-5611/26/11/115009openalex-snapshot
Nuclear norm regularization with a low-rank constraint for matrix completion
inferred← citeshttps://doi.org/10.1090/conm/270/04379openalex-snapshot
Algebraic geometry over four rings and the frontier to tractability
inferred← citeshttps://doi.org/10.1090/s1061-0022-09-01069-3openalex-snapshot
Complexity of a standard basis of a $D$-module
inferred← citeshttps://doi.org/10.1109/aisp.2012.6313742openalex-snapshot
A novel collaborative filtering model based on combination of correlation method with matrix completion technique
inferred← citeshttps://doi.org/10.1109/allerton.2008.4797640openalex-snapshot
Exact low-rank matrix completion via convex optimization
inferred← citeshttps://doi.org/10.1109/allerton.2009.5394539openalex-snapshot
Accurate low-rank matrix recovery from a small number of linear measurements
inferred← citeshttps://doi.org/10.1109/bigdatacongress.2018.00035openalex-snapshot
Learning a Joint Low-Rank and Gaussian Model in Matrix Completion with Spectral Regularization and Expectation Maximization Algorithm
inferred← citeshttps://doi.org/10.1109/ccdc69976.2026.11560392openalex-snapshot
Exact Parameter Estimation for Dynamical Systems with Finite Noisy Measurements
inferred← citeshttps://doi.org/10.1109/chicc.2015.7260414openalex-snapshot
Structure regularized traffic monitoring model for traffic matrix estimation and anomaly detection
inferred← citeshttps://doi.org/10.1109/greencom-ithings-cpscom.2013.127openalex-snapshot
Efficient Data Gathering in Wireless Sensor Networks Based on Low Rank Approximation
inferred← citeshttps://doi.org/10.1109/icassp.2011.5947147openalex-snapshot
SRF: Matrix completion based on smoothed rank function
inferred← citeshttps://doi.org/10.1109/icassp.2018.8461638openalex-snapshot
Concurrent Clutter and Noise Suppression via Low Rank Plus Sparse Optimization for Non-Contrast Ultrasound Flow Doppler Processing in Microvasculature
inferred← citeshttps://doi.org/10.1109/icassp.2018.8461826openalex-snapshot
An Improved Initialization for Low-Rank Matrix Completion Based on Rank-L Updates
inferred← citeshttps://doi.org/10.1109/icassp.2019.8682312openalex-snapshot
Local Convergence of the Heavy Ball Method in Iterative Hard Thresholding for Low-rank Matrix Completion
inferred← citeshttps://doi.org/10.1109/iccv.2011.6126273openalex-snapshot
Imaging via three-dimensional compressive sampling (3DCS)
inferred← citeshttps://doi.org/10.1109/icme.2014.6890222openalex-snapshot
Restoring corrupted motion capture data via jointly low-rank matrix completion
inferred← citeshttps://doi.org/10.1109/icmew.2014.6890668openalex-snapshot
Online video session progress prediction using low-rank matrix completion
inferred← citeshttps://doi.org/10.1109/icmlc.2016.7873010openalex-snapshot
Matric completion based on TV norm regularization and its application in image restoration
inferred← citeshttps://doi.org/10.1109/icsgsc52434.2021.9490403openalex-snapshot
Robust Long-term Rate Design via Matrix Completion
inferred← citeshttps://doi.org/10.1109/icsp.2016.7877928openalex-snapshot
Low-rank matrix recovery based on smooth function approximation
inferred← citeshttps://doi.org/10.1109/jproc.2009.2035722openalex-snapshot
Matrix Completion With Noise
inferred← citeshttps://doi.org/10.1109/sfcs.1987.1openalex-snapshot
A new algebraic method for robot motion planning and real geometry
inferred← citeshttps://doi.org/10.1109/smartgridcomm.2012.6486060openalex-snapshot
Spatiotemporal load curve data cleansing and imputation via sparsity and low rank
inferred← citeshttps://doi.org/10.1109/spawc.2016.7536744openalex-snapshot
Recovering missing data via matrix completion in electricity distribution systems
inferred← citeshttps://doi.org/10.1109/stsiva.2015.7330440openalex-snapshot
Coded aperture design for hyper-spectral image recovery via Matrix Completion
inferred← citeshttps://doi.org/10.1109/stsiva.2015.7330441openalex-snapshot
Analysis of Matrix Completion algorithms for spectral image estimation from compressive coded projections
inferred← citeshttps://doi.org/10.1109/tgrs.2019.2907801openalex-snapshot
Spectrum Recovery for Clutter Removal in Penetrating Radar Imaging
inferred← citeshttps://doi.org/10.1109/tit.2013.2250577openalex-snapshot
Restricted $p$-Isometry Properties of Nonconvex Matrix Recovery
inferred← citeshttps://doi.org/10.1109/tit.2013.2257913openalex-snapshot
Recovery of Low-Rank Plus Compressed Sparse Matrices With Application to Unveiling Traffic Anomalies
inferred← citeshttps://doi.org/10.1109/tit.2017.2784481openalex-snapshot
Blind Demixing and Deconvolution at Near-Optimal Rate
inferred← citeshttps://doi.org/10.1109/tit.2019.2959980openalex-snapshot
Low-Tubal-Rank Tensor Completion Using Alternating Minimization
inferred← citeshttps://doi.org/10.1109/tmrb.2022.3170210openalex-snapshot
Surgical Procedure Understanding, Evaluation, and Interpretation: A Dictionary Factorization Approach
inferred← citeshttps://doi.org/10.1109/tnet.2024.3397309openalex-snapshot
Robust Data Inference and Cost-Effective Cell Selection for Sparse Mobile Crowdsensing
inferred← citeshttps://doi.org/10.1109/tpami.2015.2487966openalex-snapshot
Dictionary Learning for Sparse Coding: Algorithms and Convergence Analysis
inferred← citeshttps://doi.org/10.1109/tpami.2019.2937869openalex-snapshot
Matrix Completion with Deterministic Sampling: Theories and Methods
inferred← citeshttps://doi.org/10.1109/tsp.2013.2279080openalex-snapshot
Decentralized Sparsity-Regularized Rank Minimization: Algorithms and Applications
inferred← citeshttps://doi.org/10.1109/tsp.2013.2295557openalex-snapshot
Recovery of Low-Rank Matrices Under Affine Constraints via a Smoothed Rank Function
inferred← citeshttps://doi.org/10.1109/tsp.2014.2340820openalex-snapshot
Iterative Concave Rank Approximation for Recovering Low-Rank Matrices
inferred← citeshttps://doi.org/10.1137/0218024openalex-snapshot
On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials
inferred← citeshttps://doi.org/10.1137/110820361openalex-snapshot
Low-Rank Matrix Approximation with Weights or Missing Data Is NP-Hard
inferred← citeshttps://doi.org/10.1137/15m1025153openalex-snapshot
Robust Low-Rank Matrix Completion by Riemannian Optimization
inferred← citeshttps://doi.org/10.1137/s0097539701385168openalex-snapshot
Accelerated Solution of Multivariate Polynomial Systems of Equations
inferred← citeshttps://doi.org/10.1137/s0097539791194069openalex-snapshot
Computational Complexity of Sparse Rational Interpolation
inferred← citeshttps://doi.org/10.1145/185675.185811openalex-snapshot
A single-exponential upper bound for finding shortest paths in three dimensions
inferred← citeshttps://doi.org/10.1145/1993886.1993924openalex-snapshot
The minimum-rank gram matrix completion via modified fixed point continuation method
inferred← citeshttps://doi.org/10.1145/2184319.2184343openalex-snapshot
Exact matrix completion via convex optimization
inferred← citeshttps://doi.org/10.1145/2566486.2568008openalex-snapshot
Robust multivariate autoregression for anomaly detection in dynamic product ratings
inferred← citeshttps://doi.org/10.1145/337244.337247openalex-snapshot
A subdivision-based algorithm for the sparse resultant
inferred← citeshttps://doi.org/10.1145/3452143.3465530openalex-snapshot
Cyclotomic Identity Testing and Applications
inferred← citeshttps://doi.org/10.1145/345542.345609openalex-snapshot
Bounds on numers of vectors of multiplicities for polynomials which are easy to compute
inferred← citeshttps://doi.org/10.1145/73007.73020openalex-snapshot
Quantifier elimination in the theory of an algebraically-closed field
inferred← citeshttps://doi.org/10.1371/journal.pcbi.1000949openalex-snapshot
A Computational Framework for Influenza Antigenic Cartography
inferred← citeshttps://doi.org/10.1553/etna_vol53s481openalex-snapshot
Matrix completion for matrices with low-rank displacement
inferred← citeshttps://doi.org/10.1609/aaai.v27i1.8675openalex-snapshot
Robust Discrete Matrix Completion
inferred← citeshttps://doi.org/10.1609/aaai.v33i01.33015058openalex-snapshot
Matrix Completion for Graph-Based Deep Semi-Supervised Learning
inferred← citeshttps://doi.org/10.17323/1609-4514-2007-7-3-425-452openalex-snapshot
Extremal Real Algebraic Geometry and A-Discriminants
inferred← citeshttps://doi.org/10.26686/wgtn.25808320openalex-snapshot
Effective Presentations of Mathematical Structures
inferred← citeshttps://doi.org/10.3233/com-230448openalex-snapshot
Punctually presented structures I: Closure theorems
inferred← citeshttps://doi.org/10.3233/xst-150526openalex-snapshot
Prior image constrained low-rank matrix decomposition method in limited-angle reverse helical cone-beam CT
inferred← citeshttps://doi.org/10.3390/pr12040659openalex-snapshot
A Matrix Completion Method for Imputing Missing Values of Process Data
inferred← citeshttps://doi.org/10.3934/jimo.2026002openalex-snapshot
A proximal alternative directional method of multipliers for a class of low rank matrix recovery problems
inferred← citeshttps://doi.org/10.48550/arxiv.0704.1257openalex-snapshot
Complexity of Janet basis of a D-module
inferred← citeshttps://doi.org/10.48550/arxiv.0709.2405openalex-snapshot
New Complexity Bounds for Certain Real Fewnomial Zero Sets
inferred← citeshttps://doi.org/10.48550/arxiv.0910.0651openalex-snapshot
A Simpler Approach to Matrix Completion
inferred← citeshttps://doi.org/10.48550/arxiv.1305.3002openalex-snapshot
Applications of Compressed Sensing in Communications Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1803.04104openalex-snapshot
Dedekind Zeta Zeroes and Faster Complex Dimension Computation
inferred← citeshttps://doi.org/10.48550/arxiv.2010.02383openalex-snapshot
Randomized Value Functions via Posterior State-Abstraction Sampling
inferred← citeshttps://doi.org/10.48550/arxiv.2105.01874openalex-snapshot
On the Optimality of Nuclear-norm-based Matrix Completion for Problems with Smooth Non-linear Structure
inferred← citeshttps://doi.org/10.48550/arxiv.math/0005028openalex-snapshot
Computing Complex Dimension Faster and Deterministically
inferred← citeshttps://doi.org/10.48550/arxiv.math/9702222openalex-snapshot
Toric Generalized Characteristic Polynomials
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.