The following pages link to (Q5187264):
Displaying 27 items.
- Properness defects of projection and minimal discriminant variety (Q719760) (← links)
- Precise sequential and parallel complexity bounds for quantifier elimination over algebraically closed fields (Q752692) (← links)
- Complexity of factoring and calculating the GCD of linear ordinary differential operators (Q805235) (← links)
- On computing the intersection of a pair of algebraic surfaces (Q913442) (← links)
- Computer algebra: Past and future (Q1098287) (← links)
- Solving systems of polynomial inequalities in subexponential time (Q1113939) (← links)
- 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 (Q1185456) (← links)
- The complexity of deciding consistency of systems of polynomials in exponent inequalities (Q1190747) (← links)
- Complexity of deciding Tarski algebra (Q1264143) (← links)
- An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs (Q1295548) (← links)
- Matrix completion under interval uncertainty (Q1752160) (← links)
- Solving degenerate sparse polynomial systems faster (Q1808666) (← links)
- On factoring parametric multivariate polynomials (Q1958945) (← links)
- Efficiently and effectively recognizing toricity of steady state varieties (Q2035620) (← links)
- Dealing with missing information in data envelopment analysis by means of low-rank matrix completion (Q2178379) (← links)
- Matrix completion with nonconvex regularization: spectral operators and scalable algorithms (Q2195855) (← links)
- Matrix completion for matrices with low-rank displacement (Q2203383) (← links)
- Elimination for generic sparse polynomial systems (Q2249474) (← links)
- A \(p\)-spherical section property for matrix Schatten-\(p\) quasi-norm minimization (Q2338482) (← links)
- A non-convex algorithm framework based on DC programming and DCA for matrix completion (Q2340366) (← links)
- A triangular decomposition algorithm for differential polynomial systems with elementary computation complexity (Q2400459) (← links)
- Theory of computational complexity. Part 9. Transl. from the Russian. (Q2494566) (← links)
- A nonconvex approach to low-rank matrix completion using convex optimization (Q2955982) (← links)
- An Extended Frank--Wolfe Method with “In-Face” Directions, and Its Application to Low-Rank Matrix Completion (Q2968175) (← links)
- Exploiting low-rank structure in semidefinite programming by approximate operator splitting (Q5034932) (← links)
- Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints (Q5060505) (← links)
- Punctually presented structures I: Closure theorems (Q6146821) (← links)
