Pages that link to "Item:Q1185456"
From MaRDI portal
The following pages link to 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):
Displaying 50 items.
- Root isolation of zero-dimensional polynomial systems with linear univariate representation (Q420751) (← links)
- Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces (Q431820) (← links)
- Nash equilibria: complexity, symmetries, and approximation (Q458482) (← links)
- Proving inequalities and solving global optimization problems via simplified CAD projection (Q492036) (← links)
- On the possibilistic approach to linear regression models involving uncertain, indeterminate or interval data (Q508691) (← links)
- A search-based procedure for nonlinear real arithmetic (Q518407) (← links)
- Computing the homology of real projective sets (Q667646) (← links)
- On the computation of Boolean functions by analog circuits of bounded fan-in (Q676434) (← links)
- Properness defects of projection and minimal discriminant variety (Q719760) (← links)
- Realizability of polytopes as a low rank matrix completion problem (Q741602) (← links)
- Positive semidefinite rank (Q745689) (← links)
- Worst-case results for positive semidefinite rank (Q745690) (← links)
- Discrete semantics for hybrid automata. Avoiding misleading assumptions in systems biology (Q843992) (← links)
- Blind algebraic identification of communication channels: symbolic solution algorithms (Q857886) (← links)
- Parametric probabilistic transition systems for system design and analysis (Q877158) (← links)
- Computing the top Betti numbers of semialgebraic sets defined by quadratic inequalities in polynomial time (Q937274) (← links)
- Computing the first Betti number of a semi-algebraic set (Q937278) (← links)
- FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension (Q948960) (← links)
- On sign conditions over real multivariate polynomials (Q977180) (← links)
- Inclusion dynamics hybrid automata (Q999262) (← links)
- Exotic quantifiers, complexity classes, and complete problems (Q1022429) (← links)
- Untangling a planar graph (Q1042455) (← links)
- Complexity of computing the local dimension of a semialgebraic set (Q1300630) (← links)
- Topological queries in spatial databases (Q1305920) (← links)
- The computational complexity of some problems of linear algebra (Q1307698) (← links)
- Description of the connected components of a semialgebraic set in single exponential time (Q1317872) (← links)
- Formulation of linear problems and solution by a universal machine (Q1338141) (← links)
- On the complexity of quadratic programming in real number models of computation (Q1338219) (← links)
- Querying spatial databases via topological invariants (Q1591156) (← links)
- Real computations with fake numbers (Q1599196) (← links)
- Transfer theorems via sign conditions (Q1603522) (← links)
- Grid methods in computational real algebraic (and semialgebraic) geometry (Q1754715) (← links)
- Learning from rounded-off data. (Q1873753) (← links)
- Local rules for pentagonal quasi-crystals (Q1894718) (← links)
- Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers (Q1900973) (← links)
- The exact region of stability for MacCormack scheme (Q1916052) (← links)
- Analytical solutions to the optimization of a quadratic cost function subject to linear and quadratic equality constraints (Q1921395) (← links)
- Numerically computing real points on algebraic sets (Q1956231) (← links)
- Relational hidden variables and non-locality (Q1956376) (← links)
- Polynomial hierarchy, Betti numbers, and a real analogue of Toda's theorem (Q1959088) (← links)
- Deformation techniques for efficient polynomial equation solving. (Q1977143) (← links)
- First-order orbit queries (Q2048201) (← links)
- The saddle point problem of polynomials (Q2162120) (← links)
- Termination of polynomial loops (Q2233526) (← links)
- Computing the homology of semialgebraic sets. I: Lax formulas (Q2291730) (← links)
- Deciding probabilistic bisimilarity distance one for probabilistic automata (Q2306848) (← links)
- Interactive proofs and a Shamir-like result for real number computations (Q2323360) (← links)
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q2329041) (← links)
- Special algorithm for stability analysis of multistable biological regulatory systems (Q2343243) (← links)
- Sparse differential resultant for Laurent differential polynomials (Q2351806) (← links)
