The following pages link to (Q5807665):
Displaying 50 items.
- A tool for deciding the satisfiability of continuous-time metric temporal logic (Q262137) (← links)
- Lower bounds on complexity of Lyapunov functions for switched linear systems (Q286067) (← links)
- Formally-verified decision procedures for univariate polynomial computation based on Sturm's and Tarski's theorems (Q287269) (← links)
- Holant problems for 3-regular graphs with complex edge functions (Q315538) (← links)
- Polynomial-time approximation schemes for circle and other packing problems (Q329299) (← links)
- On the solvability of derived matrix problems, including completions and duals (Q347496) (← links)
- Detection of Hopf bifurcations in chemical reaction networks using convex coordinates (Q349840) (← links)
- Commuting tuples in reductive groups and their maximal compact subgroups. (Q371277) (← links)
- Partition functions on \(k\)-regular graphs with \(\{0,1\}\)-vertex assignments and real edge functions (Q391089) (← links)
- A game-theoretic approach to fault diagnosis and identification of hybrid systems (Q391104) (← links)
- On the complexity of quantified linear systems (Q391791) (← links)
- Dominance in the family of Sugeno-Weber t-norms (Q409766) (← links)
- Fast simplifications for Tarski formulas based on monomial inequalities (Q420752) (← links)
- Variant quantifier elimination (Q420753) (← links)
- On the elementary theory of restricted real and imaginary parts of holomorphic functions (Q424581) (← links)
- Groups elementarily equivalent to a free 2-nilpotent group of finite rank. (Q431679) (← links)
- The area method. A recapitulation (Q437042) (← links)
- Robust control of uncertain systems: classical results and recent developments (Q458745) (← links)
- Erdős-Szekeres-type statements: Ramsey function and decidability in dimension 1 (Q461340) (← links)
- Efficient solution of a class of quantified constraints with quantifier prefix exists-forall (Q475420) (← links)
- Quantifier elimination for a class of exponential polynomial formulas (Q480651) (← links)
- On information invariants in robotics (Q504012) (← links)
- On the possibilistic approach to linear regression models involving uncertain, indeterminate or interval data (Q508691) (← links)
- Elementary recursive quantifier elimination based on Thom encoding and sign determination (Q529166) (← links)
- A computational proof of complexity of some restricted counting problems (Q534558) (← links)
- Quasi-interpretations. A way to control resources (Q541228) (← links)
- On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases (Q555774) (← links)
- Algebraic optimization: The Fermat-Weber location problem (Q584057) (← links)
- Orderings for term-rewriting systems (Q593789) (← links)
- Termination of linear programs with nonlinear constraints (Q604395) (← links)
- Qualitative reasoning with directional relations (Q622129) (← links)
- Condition number based complexity estimate for solving polynomial systems (Q629539) (← links)
- An algorithm for determining copositive matrices (Q636239) (← links)
- Rigidity of spherical codes (Q658415) (← links)
- Lower bound on testing membership to a polyhedron by algebraic decision and computation trees (Q677021) (← links)
- Lower bounds for polynomials of many variables (Q680071) (← links)
- A hierarchy of proof rules for checking positive invariance of algebraic and semi-algebraic sets (Q681340) (← links)
- Kripke semantics for higher-order type theory applied to constraint logic programming languages (Q683712) (← links)
- Tractability conditions for numeric CSPs (Q683751) (← links)
- Deciding consistency of systems of exponential-polynomial inequalities in subexponential time (Q684954) (← links)
- Using geometric rewrite rules for solving geometric problems symbolically (Q685375) (← links)
- Nonnegative ranks, decompositions, and factorizations of nonnegative matrices (Q686375) (← links)
- Projecting CLP(\({\mathcal R}\)) constraints (Q688823) (← links)
- On the complexity of minimizing probabilistic and quantum automata (Q690502) (← links)
- Some presentations of the real number field (Q694238) (← links)
- Quantification over propositional formulas in probability logic: decidability issues (Q695788) (← links)
- Equivariant differential topology in an o-minimal expansion of the field of real numbers (Q697618) (← links)
- Convex Sobolev inequalities derived from entropy dissipation (Q717439) (← links)
- Floodlight illumination of infinite wedges (Q733552) (← links)
- An analysis of first-order logics of probability (Q757340) (← links)
