scientific article; zbMATH DE number 3895043
From MaRDI portal
Publication:5187264
zbMath0562.03015MaRDI QIDQ5187264
Dima Yu. Grigoriev, Alexander L. Chistov
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmnumber of quantifier alternationsfirst-order theory of algebraically closed fieldsquantifier- free formulasubexponential complexity bound
Complexity of computation (including implicit computational complexity) (03D15) Model theory of fields (12L12) Quantifier elimination, model completeness, and related topics (03C10)
Related Items
Exploiting low-rank structure in semidefinite programming by approximate operator splitting, Computer algebra: Past and future, Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints, Solving systems of polynomial inequalities in subexponential time, A triangular decomposition algorithm for differential polynomial systems with elementary computation complexity, Dealing with missing information in data envelopment analysis by means of low-rank matrix completion, A nonconvex approach to low-rank matrix completion using convex optimization, Matrix completion with nonconvex regularization: spectral operators and scalable algorithms, Punctually presented structures I: Closure theorems, An Extended Frank--Wolfe Method with “In-Face” Directions, and Its Application to Low-Rank Matrix Completion, Matrix completion for matrices with low-rank displacement, On computing the intersection of a pair of algebraic surfaces, On factoring parametric multivariate polynomials, On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals, The complexity of deciding consistency of systems of polynomials in exponent inequalities, Matrix completion under interval uncertainty, Elimination for generic sparse polynomial systems, Theory of computational complexity. Part 9. Transl. from the Russian., Properness defects of projection and minimal discriminant variety, Efficiently and effectively recognizing toricity of steady state varieties, Solving degenerate sparse polynomial systems faster, Complexity of deciding Tarski algebra, Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields, An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs, A \(p\)-spherical section property for matrix Schatten-\(p\) quasi-norm minimization, A non-convex algorithm framework based on DC programming and DCA for matrix completion, Complexity of factoring and calculating the GCD of linear ordinary differential operators
