Pages that link to "Item:Q1185456"

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):

Displayed 31 items.

• On the computation of Boolean functions by analog circuits of bounded fan-in (Q676434) ‎ (← 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)
• 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)
• 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)
• Deformation techniques for efficient polynomial equation solving. (Q1977143) ‎ (← links)
• Out of order quantifier elimination for standard quantified linear programs (Q2456614) ‎ (← links)
• On projections of semi-algebraic sets defined by few quadratic inequalities (Q2482191) ‎ (← links)
• Minimizing polynomials via sum of squares over the gradient ideal (Q2492680) ‎ (← links)
• Recurrence with affine level mappings is P-time decidable for CLP (Q5437651) ‎ (← links)
• Decomposition plans for geometric constraint systems. I: Performance measures for CAD (Q5933499) ‎ (← links)
• A Gröbner free alternative for polynomial system solving (Q5938584) ‎ (← links)