Pages that link to "Item:Q1264143"

The following pages link to Complexity of deciding Tarski algebra (Q1264143):

Displaying 50 items.

• Fast simplifications for Tarski formulas based on monomial inequalities (Q420752) (← links)
• Variant quantifier elimination (Q420753) (← links)
• On information invariants in robotics (Q504012) (← links)
• A search-based procedure for nonlinear real arithmetic (Q518407) (← links)
• Elementary recursive quantifier elimination based on Thom encoding and sign determination (Q529166) (← links)
• Lower bound on testing membership to a polyhedron by algebraic decision and computation trees (Q677021) (← links)
• Stochastic game logic (Q715046) (← links)
• Floodlight illumination of infinite wedges (Q733552) (← links)
• Parametric toricity of steady state varieties of reaction networks (Q831994) (← links)
• Testing binomiality of chemical reaction networks using comprehensive Gröbner systems (Q831995) (← links)
• Discrete semantics for hybrid automata. Avoiding misleading assumptions in systems biology (Q843992) (← links)
• The complexity of planar compliant motion planning under uncertainty (Q911278) (← links)
• A numerical algorithm for zero counting. I: Complexity and accuracy (Q958246) (← links)
• Inclusion dynamics hybrid automata (Q999262) (← links)
• A bibliography of quantifier elimination for real closed fields (Q1103610) (← links)
• Effective Łojasiewicz inequalities in semialgebraic geometry (Q1177863) (← 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)
• Counting connected components of a semialgebraic set in subexponential time (Q1207337) (← links)
• Complexity of computing the local dimension of a semialgebraic set (Q1300630) (← links)
• Construction of roadmaps in semi-algebraic sets (Q1311619) (← 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)
• Formulation of linear problems and solution by a universal machine (Q1338141) (← links)
• Polar varieties, real equation solving, and data structures: the hypersurface case (Q1361872) (← links)
• Nearly sharp complexity bounds for multiprocessor algebraic computations (Q1361876) (← links)
• Complexity lower bounds for computation trees with elementary transcendental function gates (Q1365876) (← links)
• Illumination by floodlights (Q1388133) (← links)
• Homogeneous multivariate polynomials with the half-plane property (Q1432999) (← links)
• On the number of sets definable by polynomials (Q1569817) (← links)
• Decidable verification for reducible timed automata specified in a first order logic with time (Q1606131) (← links)
• A transfer method from bounded existential Diophantine equations to Tarski algebra formulas (Q1686076) (← links)
• A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications (Q1701667) (← links)
• Grid methods in computational real algebraic (and semialgebraic) geometry (Q1754715) (← links)
• Lower bounds for arithmetic networks (Q1803554) (← links)
• Local rules for pentagonal quasi-crystals (Q1894718) (← links)
• Complexity of stratifications of semi-Pfaffian sets (Q1894719) (← links)
• Lower bounds for arithmetic networks. II: Sum of Betti numbers (Q1908901) (← links)
• Polynomial hierarchy, Betti numbers, and a real analogue of Toda's theorem (Q1959088) (← links)
• Topological complexity of the range searching (Q1977139) (← links)
• Efficiently and effectively recognizing toricity of steady state varieties (Q2035620) (← links)
• A logic based approach to finding real singularities of implicit ordinary differential equations (Q2035628) (← links)
• Algorithmic reduction of biological networks with multiple time scales (Q2051597) (← links)
• Characterizing positively invariant sets: inductive and topological methods (Q2133909) (← links)
• Analyzing probabilistic pushdown automata (Q2248071) (← links)
• Computing the homology of semialgebraic sets. I: Lax formulas (Q2291730) (← links)
• A complexity theory of constructible functions and sheaves (Q2340508) (← links)
• Special algorithm for stability analysis of multistable biological regulatory systems (Q2343243) (← links)
• A class of mechanically decidable problems beyond Tarski's model (Q2475316) (← links)
• Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets (Q2489141) (← links)