The following pages link to (Q4079605):
Displaying 50 items.
- Formally-verified decision procedures for univariate polynomial computation based on Sturm's and Tarski's theorems (Q287269) (← links)
- Multivariate discriminant and iterated resultant (Q296167) (← links)
- Inverse inequality estimates with symbolic computation (Q308968) (← links)
- An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination (Q384995) (← links)
- Dominance in the family of Sugeno-Weber t-norms (Q409766) (← links)
- Trading order for degree in creative telescoping (Q414630) (← links)
- Divide and conquer roadmap for algebraic sets (Q464736) (← links)
- Quantifier elimination for a class of exponential polynomial formulas (Q480651) (← links)
- Computation of topological invariants for real projective surfaces with isolated singularities (Q480681) (← links)
- A baby step-giant step roadmap algorithm for general algebraic sets (Q486687) (← links)
- On using Lazard's projection in CAD construction (Q492024) (← links)
- Proving inequalities and solving global optimization problems via simplified CAD projection (Q492036) (← links)
- A search-based procedure for nonlinear real arithmetic (Q518407) (← links)
- Structural types for systems of equations: type refinements for structurally dynamic first-class modular systems of equations (Q526451) (← 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)
- Real solution isolation with multiplicity of zero-dimensional triangular systems (Q543162) (← links)
- Bounds on the number of steps of WDS required for checking the positivity of integral forms (Q555413) (← links)
- On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases (Q555774) (← links)
- Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets (Q581617) (← links)
- The computation of polynomial greatest common divisors over an algebraic number field (Q582076) (← links)
- Termination of linear programs with nonlinear constraints (Q604395) (← links)
- A generic and flexible framework for the geometrical and topological analysis of (algebraic) surfaces (Q625206) (← links)
- Condition number based complexity estimate for solving polynomial systems (Q629539) (← links)
- An algorithm for determining copositive matrices (Q636239) (← links)
- Cylindrical decomposition for systems transcendental in the first variable (Q650841) (← links)
- Solving parametric piecewise polynomial systems (Q651936) (← links)
- Deciding polynomial-transcendental problems (Q654031) (← links)
- Computing the homology of real projective sets (Q667646) (← links)
- On the positivity of the Gillis-Reznick-Zeilberger rational function (Q670644) (← links)
- A note on dead-beat controllability of generalised Hammerstein systems (Q673277) (← links)
- Towards exact geometric computation (Q676577) (← links)
- Using geometric rewrite rules for solving geometric problems symbolically (Q685375) (← links)
- On the computation of an arrangement of quadrics in 3D (Q705551) (← links)
- Some new results on decidability for elementary algebra and geometry (Q714712) (← links)
- Properness defects of projection and minimal discriminant variety (Q719760) (← links)
- Topology and arrangement computation of semi-algebraic planar curves (Q735517) (← links)
- Complexity of computation on real algebraic numbers (Q757065) (← links)
- Fields of algebraic numbers computable in polynomial time. I (Q784464) (← links)
- Definability and fast quantifier elimination in algebraically closed fields (Q798314) (← links)
- Solving systems of polynomial inequalities over a real closed field in subexponential time (Q804242) (← links)
- Implicit semi-algebraic abstraction for polynomial dynamical systems (Q832202) (← links)
- Interpolation and model checking for nonlinear arithmetic (Q832268) (← links)
- \textit{Theorema}: Towards computer-aided mathematical theory exploration (Q865646) (← links)
- Quantifier elimination for the reals with a predicate for the powers of two (Q868941) (← links)
- Multiphase until formulas over Markov reward models: an algebraic approach (Q896909) (← links)
- Analyzing ultimate positivity for solvable systems (Q897909) (← links)
- Change-of-bases abstractions for non-linear hybrid systems (Q901261) (← links)
- Nonrealizability proofs in computational geometry (Q912857) (← links)
- Triangulating a nonconvex polytope (Q914375) (← links)
