Pages that link to "Item:Q3158549"
From MaRDI portal
The following pages link to New results on quantifier elimination over real closed fields and applications to constraint databases (Q3158549):
Displaying 24 items.
- Logic for physical space. From antiquity to present day (Q382998) (← links)
- On the complexity of quantified linear systems (Q391791) (← links)
- Fast simplifications for Tarski formulas based on monomial inequalities (Q420752) (← links)
- \(q\)-Bessel positive definite and \(D _{q }\)-completely monotonic functions (Q427257) (← links)
- Constraint Markov chains (Q554215) (← links)
- Generalizations of Kochen and Specker's theorem and the effectiveness of Gleason's theorem (Q720586) (← links)
- An incremental algorithm for DLO quantifier elimination via constraint propagation (Q814643) (← links)
- Computing uniformly optimal strategies in two-player stochastic games (Q847800) (← links)
- Quantifier elimination for the reals with a predicate for the powers of two (Q868941) (← links)
- Stochastic limit-average games are in EXPTIME (Q933752) (← links)
- On metrics for probabilistic systems: definitions and algorithms (Q971582) (← links)
- An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs (Q1295548) (← links)
- Limits of theory sequences over algebraically closed fields and applications. (Q1421482) (← links)
- Anderson localization for Schrödinger operators on \(\mathbb{Z}^2\)with quasi-periodic potential (Q1611556) (← links)
- Efficient evaluation of specific queries in constraint databases (Q1944172) (← links)
- Approximation schemes for \(r\)-weighted minimization knapsack problems (Q2288864) (← links)
- From simplification to a partial theory solver for non-linear real polynomial constraints (Q2307623) (← links)
- Out of order quantifier elimination for standard quantified linear programs (Q2456614) (← links)
- Geometric complexity theory. V: Efficient algorithms for Noether normalization (Q2826783) (← links)
- Improved Algorithms for Sign Determination and Existential Quantifier Elimination (Q3140551) (← links)
- Symbolic Model Checking in Non-Boolean Domains (Q3176389) (← links)
- Quantifier elimination by cylindrical algebraic decomposition based on regular chains (Q5925208) (← links)
- Computing with Tarski formulas and semi-algebraic sets in a web browser (Q6170823) (← links)
- The fragment of elementary plane Euclidean geometry based on perpendicularity alone with complexity PSPACE-complete (Q6664346) (← links)
