Pages that link to "Item:Q1355986"
From MaRDI portal
The following pages link to Quantifier elimination and cylindrical algebraic decomposition. Proceedings of a symposium, Linz, Austria, October 6--8, 1993 (Q1355986):
Displaying 50 items.
- A hypergeometric inequality (Q259718) (← links)
- Lower bounds on complexity of Lyapunov functions for switched linear systems (Q286067) (← links)
- An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination (Q384995) (← links)
- Trading order for degree in creative telescoping (Q414630) (← links)
- Fast simplifications for Tarski formulas based on monomial inequalities (Q420752) (← links)
- Elliptic curves and Fibonacci numbers arising from Lindenmayer system with symbolic computation (Q429747) (← links)
- PLQP \& Company: decidable logics for quantum algorithms (Q472733) (← links)
- Efficient solution of a class of quantified constraints with quantifier prefix exists-forall (Q475420) (← links)
- A deterministic algorithm for isolating real roots of a real polynomial (Q607163) (← links)
- A generic and flexible framework for the geometrical and topological analysis of (algebraic) surfaces (Q625206) (← links)
- Deciding polynomial-transcendental problems (Q654031) (← links)
- Some new results on decidability for elementary algebra and geometry (Q714712) (← links)
- A worst-case bound for topology computation of algebraic curves (Q765857) (← links)
- Quantifier elimination for the reals with a predicate for the powers of two (Q868941) (← links)
- An efficient algorithm for the stratification and triangulation of an algebraic surface (Q1037650) (← links)
- Reachability and connectivity queries in constraint databases (Q1394800) (← links)
- Homogeneous multivariate polynomials with the half-plane property (Q1432999) (← links)
- Automatic derivation of positivity conditions inside boundary elements with the help of the REDLOG computer logic package. (Q1568438) (← links)
- Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey (Q1581129) (← links)
- Quantified constraints under perturbation (Q1600045) (← links)
- A symbolic computation approach to parameterizing controller for polynomial Hamiltonian systems (Q1719176) (← links)
- Robust simultaneous stabilization control method for two port-controlled Hamiltonian systems: controller parameterization (Q1724889) (← links)
- Application of quantifier elimination to inverse buckling problems (Q1742348) (← links)
- Automatic generation of bounds for polynomial systems with application to the Lorenz system (Q1755304) (← links)
- Interval arithmetic in cylindrical algebraic decomposition (Q1864882) (← links)
- Representing rational curve segments and surface patches using semi-algebraic sets (Q2010339) (← links)
- Quasi-decidability of a fragment of the first-order theory of real numbers (Q2013319) (← links)
- The impact on the properties of the EFGM copulas when extending this family (Q2049225) (← links)
- A comparison of algorithms for proving positivity of linearly recurrent sequences (Q2109988) (← links)
- High-order quadrature on multi-component domains implicitly defined by multivariate polynomials (Q2134493) (← links)
- Polynomial bivariate copulas of degree five: characterization and some particular inequalities (Q2245659) (← links)
- Safety verification of non-linear hybrid systems is quasi-decidable (Q2248097) (← links)
- On types of degenerate critical points of real polynomial functions (Q2284966) (← links)
- Fully incremental cylindrical algebraic decomposition (Q2307621) (← links)
- From simplification to a partial theory solver for non-linear real polynomial constraints (Q2307623) (← links)
- Finding proofs in Tarskian geometry (Q2362499) (← links)
- Subquadratic algorithms for algebraic 3SUM (Q2415376) (← links)
- An algorithm to parametrize approximately space curves (Q2437227) (← links)
- Real quantifier elimination for the synthesis of optimal numerical algorithms (case study: square root computation) (Q2635072) (← links)
- A Simple Quantifier-Free Formula of Positive Semidefinite Cyclic Ternary Quartic Forms (Q2799565) (← links)
- A Family of Robust Simultaneous Controllers With Tuning Parameters Design for a Set of Port-Controlled Hamiltonian Systems (Q2970881) (← links)
- Applied Algebraic Geometry in Model Based Design for Manufacturing (Q3455008) (← links)
- A DECISION PROCEDURE FOR PROBABILITY CALCULUS WITH APPLICATIONS (Q3580663) (← links)
- Tarski’s Influence on Computer Science (Q4611682) (← links)
- Improved Cross-Validation for Classifiers that Make Algorithmic Choices to Minimise Runtime Without Compromising Output Correctness (Q5014692) (← links)
- A Machine Learning Based Software Pipeline to Pick the Variable Ordering for Algorithms with Polynomial Inputs (Q5041068) (← links)
- Fregel: a functional domain-specific language for vertex-centric large-scale graph processing (Q5063249) (← links)
- Feferman on Computability (Q5214780) (← links)
- Automatic Symmetrization and Energy Estimates Using Local Operators for Partial Differential Equations (Q5421513) (← links)
- A Computer Proof of Moll’s Log-Concavity Conjecture (Q5423939) (← links)
