Pages that link to "Item:Q1185458"

The following pages link to On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination (Q1185458):

Displaying 50 items.

• A polynomial-time algorithm for computing low CP-rank decompositions (Q344517) (← links)
• On the complexity of quantified linear systems (Q391791) (← links)
• Fast simplifications for Tarski formulas based on monomial inequalities (Q420752) (← links)
• Variant quantifier elimination (Q420753) (← links)
• Equilibria, fixed points, and complexity classes (Q458480) (← links)
• The \(\mathcal A\)-truncated \(K\)-moment problem (Q486690) (← links)
• A complexity perspective on entailment of parameterized linear constraints (Q487646) (← links)
• On the possibilistic approach to linear regression models involving uncertain, indeterminate or interval data (Q508691) (← links)
• Elementary recursive quantifier elimination based on Thom encoding and sign determination (Q529166) (← links)
• Polynomial equation solving by lifting procedures for ramified fibers (Q598210) (← links)
• Bounding the radii of balls meeting every connected component of semi-algebraic sets (Q607049) (← links)
• Hardness of embedding simplicial complexes in \(\mathbb R^d\) (Q621847) (← links)
• A weak version of the Blum, Shub, and Smale model (Q676432) (← links)
• Nonnegative ranks, decompositions, and factorizations of nonnegative matrices (Q686375) (← links)
• Computation of equilibria in noncooperative games (Q815274) (← links)
• A note on the computation of the CP-rank (Q854849) (← links)
• Quantifier elimination for the reals with a predicate for the powers of two (Q868941) (← links)
• FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension (Q948960) (← links)
• Computational complexity of determining which statements about causality hold in different space-time models (Q949614) (← links)
• Hybrid automata, reachability, and systems biology (Q969180) (← links)
• Some lower bounds for the complexity of the linear programming feasibility problem over the reals (Q998976) (← links)
• Inclusion dynamics hybrid automata (Q999262) (← links)
• Real addition and the polynomial hierarchy (Q1063589) (← links)
• Rectilinear shortest paths in the presence of rectangular barriers (Q1109046) (← links)
• Computability of a map and decidability of its graph in the model of Blum, Shub and Smale (Q1127553) (← 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)
• On the computational complexity and geometry of the first-order theory of the reals. II: The general decision problem. Preliminaries for quantifier elimination (Q1185457) (← links)
• \(\delta\)-uniform BSS machines (Q1271171) (← links)
• A quantifier elimination for the theory of \(p\)-adic numbers (Q1277096) (← links)
• An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs (Q1295548) (← links)
• Saturation and stability in the theory of computation over the reals (Q1304539) (← links)
• Description of the connected components of a semialgebraic set in single exponential time (Q1317872) (← links)
• Finding irreducible components of some real transcendental varieties (Q1332661) (← links)
• Separation of complexity classes in Koiran's weak model (Q1338212) (← links)
• P\(\neq\)NP over the nonstandard reals implies P\(\neq\)NP over \(\mathbb{R}\) (Q1338220) (← links)
• Polar varieties, real equation solving, and data structures: the hypersurface case (Q1361872) (← links)
• On computing a set of points meeting every cell defined by a family of polynomials on a variety (Q1361873) (← links)
• Complexity lower bounds for computation trees with elementary transcendental function gates (Q1365876) (← links)
• Finitely representable databases (Q1376408) (← links)
• Queries with arithmetical constraints (Q1391932) (← links)
• Homogeneous multivariate polynomials with the half-plane property (Q1432999) (← links)
• Counting problems over the reals (Q1575534) (← links)
• Quantifier elimination for trigonometric polynomials by cylindrical trigonometric decomposition (Q1581134) (← links)
• Decidable verification for reducible timed automata specified in a first order logic with time (Q1606131) (← links)
• Open weak CAD and its applications (Q1711996) (← links)
• Grid methods in computational real algebraic (and semialgebraic) geometry (Q1754715) (← links)
• Approximating the minimum rank of a graph via alternating projection (Q1785758) (← links)
• Matrices in elimination theory (Q1808659) (← links)
• Real solving for positive dimensional systems. (Q1867000) (← links)
• The complexity to compute the Euler characteristic of complex varieties (Q1886973) (← links)