The following pages link to (Q5301651):
Displaying 44 items.
- Cylindrical algebraic sub-decompositions (Q475412) (← links)
- Proving inequalities and solving global optimization problems via simplified CAD projection (Q492036) (← links)
- Constraint Markov chains (Q554215) (← links)
- CAD and topology of semi-algebraic sets (Q626978) (← links)
- Some lower bounds for the complexity of the linear programming feasibility problem over the reals (Q998976) (← links)
- Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings (Q1996869) (← links)
- Using machine learning to improve cylindrical algebraic decomposition (Q2009221) (← links)
- A logic based approach to finding real singularities of implicit ordinary differential equations (Q2035628) (← links)
- On algorithms testing positivity of real symmetric polynomials (Q2072924) (← links)
- Formula simplification via invariance detection by algebraically indexed types (Q2104529) (← links)
- New heuristic to choose a cylindrical algebraic decomposition variable ordering motivated by complexity analysis (Q2109991) (← links)
- Solving parametric systems of polynomial equations over the reals through Hermite matrices (Q2117425) (← links)
- The saddle point problem of polynomials (Q2162120) (← links)
- Cylindrical algebraic decomposition with equational constraints (Q2307622) (← links)
- Single-factor coefficient bounds (Q2643575) (← links)
- Positive dimensional parametric polynomial systems, connectivity queries and applications in robotics (Q2674013) (← links)
- $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation (Q2817292) (← links)
- Need Polynomial Systems Be Doubly-Exponential? (Q2819212) (← links)
- The Complexity of Cylindrical Algebraic Decomposition with Respect to Polynomial Degree (Q2829999) (← links)
- Adapting Real Quantifier Elimination Methods for Conflict Set Computation (Q2964460) (← links)
- Recent Advances in Real Geometric Reasoning (Q3452275) (← links)
- (Q4234240) (← links)
- On the combinatorial and algebraic complexity of quantifier elimination (Q4371694) (← links)
- Computing Linear Extensions for Polynomial Posets Subject to Algebraic Constraints (Q5001675) (← links)
- Improved Cross-Validation for Classifiers that Make Algorithmic Choices to Minimise Runtime Without Compromising Output Correctness (Q5014692) (← links)
- Variable Ordering Selection for Cylindrical Algebraic Decomposition with Artificial Neural Networks (Q5041065) (← links)
- A Machine Learning Based Software Pipeline to Pick the Variable Ordering for Algorithms with Polynomial Inputs (Q5041068) (← links)
- Projection and Quantifier Elimination Using Non-uniform Cylindrical Algebraic Decomposition (Q5119922) (← links)
- Complexity of quantifier elimination in the theory of ordinary differential equations (Q5393295) (← links)
- Problem Formulation for Truth-Table Invariant Cylindrical Algebraic Decomposition by Incremental Triangular Decomposition (Q5495913) (← links)
- Applying Machine Learning to the Problem of Choosing a Heuristic to Select the Variable Ordering for Cylindrical Algebraic Decomposition (Q5495916) (← links)
- Quantifier elimination by cylindrical algebraic decomposition based on regular chains (Q5925208) (← links)
- Truth table invariant cylindrical algebraic decomposition (Q5963392) (← links)
- Digital collections of examples in mathematical sciences (Q6086393) (← links)
- Explainable AI insights for symbolic computation: a case study on selecting the variable ordering for cylindrical algebraic decomposition (Q6149145) (← links)
- Is computer algebra ready for conjecturing and proving geometric inequalities in the classroom? (Q6157640) (← links)
- Introducing asynchronicity to probabilistic hyperproperties (Q6546446) (← links)
- An explicit 16-stage Runge-Kutta method of order 10 discovered by numerical search (Q6559449) (← links)
- Exploring alternative machine learning models for variable ordering in cylindrical algebraic decomposition (Q6637810) (← links)
- Constrained neural networks for interpretable heuristic creation to optimise computer algebra systems (Q6637811) (← links)
- Lessons on datasets and paradigms in machine learning for symbolic computation: a case study on CAD (Q6653101) (← links)
- Supporting proving and discovering geometric inequalities in GeoGebra by using Tarski (Q6653970) (← links)
- Recent developments in real quantifier elimination and cylindrical algebraic decomposition (extended abstract of invited talk) (Q6660310) (← links)
- A dataset for suggesting variable orderings for cylindrical algebraic decompositions (Q6660322) (← links)
