Pages that link to "Item:Q1185458"
From MaRDI portal
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.
- The real dimension problem is \(\text{NP}_{\mathbb R}\)-complete. (Q1974570) (← links)
- The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game (Q1995464) (← links)
- Factoring a band matrix over a semiring (Q2041261) (← links)
- On extremal graphs for zero forcing number (Q2102756) (← links)
- Equivalence checking of quantum finite-state machines (Q2220441) (← links)
- Intrinsic complexity estimates in polynomial optimization (Q2251913) (← links)
- Language equivalence of probabilistic pushdown automata (Q2252520) (← links)
- Periodic generalized automata over the reals (Q2280333) (← links)
- A complexity theory of constructible functions and sheaves (Q2340508) (← links)
- Special algorithm for stability analysis of multistable biological regulatory systems (Q2343243) (← links)
- Generalized polar varieties: geometry and algorithms (Q2387411) (← links)
- Equivalence of state representations for hidden Markov models (Q2427474) (← links)
- Quantum automata and algebraic groups (Q2456549) (← links)
- Computing the first few Betti numbers of semi-algebraic sets in single exponential time (Q2457390) (← links)
- An elementary proof of Sylvester's double sums for subresultants (Q2457422) (← links)
- Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets (Q2489141) (← links)
- Computational complexity of diagram satisfaction in Euclidean geometry (Q2489144) (← links)
- Real quantifier elimination for the synthesis of optimal numerical algorithms (case study: square root computation) (Q2635072) (← links)
- Quantifier elimination theory and maps which preserve semipositivity (Q2687228) (← links)
- Macaulay style formulas for sparse resultants (Q2782655) (← links)
- Trace Refinement in Labelled Markov Decision Processes (Q2811347) (← links)
- Computing a nonnegative matrix factorization -- provably (Q2817794) (← links)
- Exact algorithms for linear matrix inequalities (Q2834563) (← links)
- Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity (Q2871188) (← links)
- Une borne optimale pour la programmation entière quasi-convexe (Q3136700) (← links)
- On the Complexity of Quantifier Elimination: the Structural Approach (Q3140550) (← links)
- The theory of Liouville functions (Q3160545) (← links)
- Recent Advances in Real Geometric Reasoning (Q3452275) (← links)
- Interval Linear Algebra and Computational Complexity (Q4554518) (← links)
- Matrices of Bounded Psd Rank are Easy to Detect (Q4577739) (← links)
- A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors (Q4687245) (← links)
- Computing roadmaps of semi-algebraic sets on a variety (Q4700178) (← links)
- Sur la complexité du principe de Tarski-Seidenberg (Q4713865) (← links)
- Constraint Satisfaction Problems over Numeric Domains (Q4993596) (← links)
- On maps which preserve semipositivity and quantifier elimination theory for real numbers (Q5065095) (← links)
- An Exact Correspondence of Linear Problems and Randomizing Linear Algorithms (Q5244858) (← links)
- (Q5389777) (← links)
- Hybrid Automata in Systems Biology: How Far Can We Go? (Q5404076) (← links)
- Theorem Proving in Higher Order Logics (Q5464659) (← links)
- Lower bounds for RAMs and quantifier elimination (Q5495851) (← links)
- An Almost Optimal Algorithm for Computing Nonnegative Rank (Q5743610) (← links)
- Logical Approaches to Computational Barriers (Q5898843) (← links)
- Finding at least one point in each connected component of a real algebraic set defined by a single equation (Q5925972) (← links)
- Back-and-forth systems for generic curves and a decision algorithm for the limit theory (Q5946087) (← links)
- Improved projection for cylindrical algebraic decomposition (Q5950980) (← links)
- Explicit formulas for the multivariate resultant. (Q5951557) (← links)
- Automatic derivation of probabilistic inference rules (Q5952206) (← links)
- Computational complexity of quantifier-free negationless theory of field of rational numbers (Q5957912) (← links)
- Cylindrical algebraic decomposition using local projections (Q5963393) (← links)
- The Complexity of Drawing Graphs on Few Lines and Few Planes (Q6075709) (← links)
