Quantifier elimination and cylindrical algebraic decomposition. Proceedings of a symposium, Linz, Austria, October 6--8, 1993

No author found.

Publication date: 2 June 1997

Published in: Texts \& Monographs in Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

Proceedings Symposium cylindrical algebraic decomposition Quantifier elimination Linz (Austria)Cylindrical algebraic decomposition language of real arithmetic quantifier elemination

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) Quantifier elimination, model completeness, and related topics (03C10)

Related Items (53)

Finding proofs in Tarskian geometry ⋮ A Machine Learning Based Software Pipeline to Pick the Variable Ordering for Algorithms with Polynomial Inputs ⋮ Lower bounds on complexity of Lyapunov functions for switched linear systems ⋮ High-order quadrature on multi-component domains implicitly defined by multivariate polynomials ⋮ Applied Algebraic Geometry in Model Based Design for Manufacturing ⋮ Real quantifier elimination for the synthesis of optimal numerical algorithms (case study: square root computation) ⋮ Fregel: a functional domain-specific language for vertex-centric large-scale graph processing ⋮ Quantifier elimination for the reals with a predicate for the powers of two ⋮ A deterministic algorithm for isolating real roots of a real polynomial ⋮ An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination ⋮ Subquadratic algorithms for algebraic 3SUM ⋮ Reachability and connectivity queries in constraint databases ⋮ A generic and flexible framework for the geometrical and topological analysis of (algebraic) surfaces ⋮ Trading order for degree in creative telescoping ⋮ Levelwise construction of a single cylindrical algebraic cell ⋮ Fast simplifications for Tarski formulas based on monomial inequalities ⋮ Elliptic curves and Fibonacci numbers arising from Lindenmayer system with symbolic computation ⋮ A Family of Robust Simultaneous Controllers With Tuning Parameters Design for a Set of Port-Controlled Hamiltonian Systems ⋮ An algorithm to parametrize approximately space curves ⋮ Tarski’s Influence on Computer Science ⋮ A symbolic computation approach to parameterizing controller for polynomial Hamiltonian systems ⋮ Deciding polynomial-transcendental problems ⋮ Robust simultaneous stabilization control method for two port-controlled Hamiltonian systems: controller parameterization ⋮ PLQP \& Company: decidable logics for quantum algorithms ⋮ Efficient solution of a class of quantified constraints with quantifier prefix exists-forall ⋮ Homogeneous multivariate polynomials with the half-plane property ⋮ Application of quantifier elimination to inverse buckling problems ⋮ Polynomial bivariate copulas of degree five: characterization and some particular inequalities ⋮ Safety verification of non-linear hybrid systems is quasi-decidable ⋮ Automatic generation of bounds for polynomial systems with application to the Lorenz system ⋮ A DECISION PROCEDURE FOR PROBABILITY CALCULUS WITH APPLICATIONS ⋮ Automatic Symmetrization and Energy Estimates Using Local Operators for Partial Differential Equations ⋮ A Computer Proof of Moll’s Log-Concavity Conjecture ⋮ Representing rational curve segments and surface patches using semi-algebraic sets ⋮ Quasi-decidability of a fragment of the first-order theory of real numbers ⋮ Some new results on decidability for elementary algebra and geometry ⋮ On types of degenerate critical points of real polynomial functions ⋮ A Simple Quantifier-Free Formula of Positive Semidefinite Cyclic Ternary Quartic Forms ⋮ Cylindrical algebraic decomposition using local projections ⋮ Feferman on Computability ⋮ The impact on the properties of the EFGM copulas when extending this family ⋮ Fully incremental cylindrical algebraic decomposition ⋮ From simplification to a partial theory solver for non-linear real polynomial constraints ⋮ Quantifier elimination by cylindrical algebraic decomposition based on regular chains ⋮ A worst-case bound for topology computation of algebraic curves ⋮ Automatic derivation of positivity conditions inside boundary elements with the help of the REDLOG computer logic package. ⋮ An efficient algorithm for the stratification and triangulation of an algebraic surface ⋮ Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey ⋮ Improved Cross-Validation for Classifiers that Make Algorithmic Choices to Minimise Runtime Without Compromising Output Correctness ⋮ Quantified constraints under perturbation ⋮ A comparison of algorithms for proving positivity of linearly recurrent sequences ⋮ Interval arithmetic in cylindrical algebraic decomposition ⋮ A hypergeometric inequality

This page was built for publication: Quantifier elimination and cylindrical algebraic decomposition. Proceedings of a symposium, Linz, Austria, October 6--8, 1993