QEPCAD

swMATH752MaRDI QIDQ13503FDOQ13503

Author name not available (Why is that?)

Described by source

• QEPCAD B

Cited In (only showing first 100 items - show all)

• Title not available (Why is that?)
• On the complexity of quantified linear systems
• On invariant checking
• Title not available (Why is that?)
• Title not available (Why is that?)
• Polynomial optimization with applications to stability analysis and control -- alternatives to sum of squares
• A hypergeometric inequality
• Dominance in the family of Sugeno-Weber t-norms
• A quantifier-elimination based heuristic for automatically generating inductive assertions for programs
• Bounds for absolute positiveness of multivariate polynomials
• Computing GCDs of polynomials over algebraic number fields
• Simulation and optimization by quantifier elimination
• Algebraic approaches to stability analysis of biological systems
• Algorithms in real algebraic geometry
• Algorithms in real algebraic geometry
• Differential dynamic logic for hybrid systems
• A new approach for automatic theorem proving in real geometry
• Approximate quantified constraint solving by cylindrical box decomposition
• Algorithms for trigonometric curves (simplification, implicitization, parameterization)
• Real zeros of the zero-dimensional parametric piecewise algebraic variety
• Automated theorem proving for special functions: the next phase
• Real World Verification
• Extending a Resolution Prover for Inequalities on Elementary Functions
• Hybrid Systems: Computation and Control
• Partial cylindrical algebraic decomposition for quantifier elimination
• KeYmaera: A Hybrid Theorem Prover for Hybrid Systems (System Description)
• Automatic computation of the complete root classification for a parametric polynomial
• Computer Aided Verification
• Heuristics for exact nonnegative matrix factorization
• An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination
• Computer algebra for special function inequalities
• Proving inequalities and solving global optimization problems via simplified CAD projection
• Discovering Non-linear Ranking Functions by Solving Semi-algebraic Systems
• Algebraic analysis on asymptotic stability of continuous dynamical systems
• Generating Polynomial Invariants with DISCOVERER and QEPCAD
• Investigating Generic Methods to Solve Hopf Bifurcation Problems in Algebraic Biology
• MetiTarski: An automatic theorem prover for real-valued special functions
• Solving systems of strict polynomial inequalities
• Cylindrical algebraic decomposition using validated numerics
• Improved projection for cylindrical algebraic decomposition
• Computational complexity and feasibility of data processing and interval computations
• Algebraic Analysis of Bifurcation and Limit Cycles for Biological Systems
• On solving systems of bivariate polynomials
• Interval arithmetic in cylindrical algebraic decomposition
• Title not available (Why is that?)
• Title not available (Why is that?)
• Discovering polynomial Lyapunov functions for continuous dynamical systems
• Solving Polynomial Strict Inequalities Using Cylindrical Algebraic Decomposition
• On the robustness and optimality of algebraic multilevel methods for reaction-diffusion type problems
• MetiTarski: An Automatic Prover for the Elementary Functions
• Open weak CAD and its applications
• Providing a Basin of Attraction to a Target Region of Polynomial Systems by Computation of Lyapunov-Like Functions
• Computing cylindrical algebraic decomposition via triangular decomposition
• Detection of Hopf bifurcations in chemical reaction networks using convex coordinates
• Recent advances in program verification through computer algebra
• Constructing invariants for hybrid systems
• On Proving the Absence of Oscillations in Models of Genetic Circuits
• Title not available (Why is that?)
• Hybrid automata, reachability, and systems biology
• Symbolic decision procedure for termination of linear programs
• Termination of linear programs with nonlinear constraints
• Verification, Model Checking, and Abstract Interpretation
• Investigating algebraic and logical algorithms to solve Hopf bifurcation problems in algebraic biology
• An SOS-QE approach to nonlinear gain analysis for polynomial dynamical systems
• Stability analysis for discrete biological models using algebraic methods
• Quantifier elimination for real algebra -- the quadratic case and beyond
• Hybrid Automata in Systems Biology: How Far Can We Go?
• A complete discrimination system for polynomials with complex coefficients and its automatic generation
• A local Fourier convergence analysis of a multigrid method using symbolic computation
• Triangular decomposition of semi-algebraic systems
• Formal proofs in real algebraic geometry: from ordered fields to quantifier elimination
• An algorithmic construction of entropies in higher-order nonlinear PDEs
• Computational complexity of determining which statements about causality hold in different space-time models
• SyNRAC: a toolbox for solving real algebraic constraints
• Polynomial constraints and unsat cores in \textsc{Tarski}
• Parametric polynomial spectral factorization using the sum of roots and its application to a control design problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Simplification of quantifier-free formulae over ordered fields
• Products of foldable triangulations
• Deciding Hopf bifurcations by quantifier elimination in a software-component architecture
• Implementing the cylindrical algebraic decomposition within the Coq system
• Quantified set inversion algorithm with applications to control
• Variant quantifier elimination
• Recent advances on determining the number of real roots of parametric polynomials
• A semi-algebraic approach for asymptotic stability analysis
• A decision procedure for probability calculus with applications
• Combined Decision Techniques for the Existential Theory of the Reals
• Solution to the generalized champagne problem on simultaneous stabilization of linear systems
• An Algorithm for Computing the Complete Root Classification of a Parametric Polynomial
• Quantifier elimination on real closed fields and differential equations
• Editorial: Symbolic computation and satisfiability checking
• Title not available (Why is that?)
• Parametric toricity of steady state varieties of reaction networks
• A parameter space approach to fixed-order robust controller synthesis by quantifier elimination
• Optimizing a particular real root of a polynomial by a special cylindrical algebraic decomposition
• Title not available (Why is that?)
• Building bridges between symbolic computation and satisfiability checking
• Global optimization of polynomials over real algebraic sets
• Geometry and topology of parameter space: Investigating measures of robustness in regulatory networks

This page was built for software: QEPCAD