The following pages link to Matthew England (Q247221):
Displaying 50 items.
- Building abelian functions with generalised Baker-Hirota operators (Q431500) (← links)
- Cylindrical algebraic sub-decompositions (Q475412) (← links)
- (Q592964) (redirect page) (← links)
- Deriving bases for abelian functions (Q766034) (← links)
- Higher genus abelian functions associated with cyclic trigonal curves (Q970341) (← links)
- Machine learning for mathematical software (Q1662224) (← links)
- TheoryGuru: a Mathematica package to apply quantifier elimination technology to economics (Q1662274) (← links)
- Symbolic versus numerical computation and visualization of parameter regions for multistationarity of biological networks (Q1701474) (← links)
- Generalised elliptic functions (Q1935629) (← 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)
- New heuristic to choose a cylindrical algebraic decomposition variable ordering motivated by complexity analysis (Q2109991) (← links)
- Identifying the parametric occurrence of multiple steady states for some biological networks (Q2284952) (← links)
- Comparing machine learning models to choose the variable ordering for cylindrical algebraic decomposition (Q2287902) (← links)
- Cylindrical algebraic decomposition with equational constraints (Q2307622) (← links)
- $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation (Q2817292) (← links)
- Need Polynomial Systems Be Doubly-Exponential? (Q2819212) (← links)
- Improving the Use of Equational Constraints in Cylindrical Algebraic Decomposition (Q2819754) (← links)
- The Complexity of Cylindrical Algebraic Decomposition with Respect to Polynomial Degree (Q2829999) (← links)
- Optimising Problem Formulation for Cylindrical Algebraic Decomposition (Q2843003) (← links)
- Understanding Branch Cuts of Expressions (Q2843010) (← links)
- Choosing a Variable Ordering for Truth-Table Invariant Cylindrical Algebraic Decomposition by Incremental Triangular Decomposition (Q2879160) (← links)
- Using the Regular Chains Library to Build Cylindrical Algebraic Decompositions by Projecting and Lifting (Q2879161) (← links)
- Truth Table Invariant Cylindrical Algebraic Decomposition by Regular Chains (Q2879312) (← links)
- Cylindrical algebraic decompositions for boolean combinations (Q2963225) (← links)
- Recent Advances in Real Geometric Reasoning (Q3452275) (← links)
- Abelian functions associated with a cyclic tetragonal curve of genus six (Q3615488) (← links)
- A genus six cyclic tetragonal reduction of the Benney equations (Q3648221) (← links)
- The Potential and Challenges of CAD with Equational Constraints for SC-Square (Q4628500) (← 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)
- The DEWCAD project (Q5102008) (← links)
- A Case Study on the Parametric Occurrence of Multiple Steady States (Q5119921) (← links)
- Real quantifier elimination by cylindrical algebraic decomposition, and improvements by machine learning (Q5145948) (← links)
- Abelian functions associated with genus three algebraic curves (Q5169587) (← links)
- Satisfiability checking and symbolic computation (Q5268815) (← links)
- Branch cuts in maple 17 (Q5270639) (← links)
- Some new addition formulae for Weierstrass elliptic functions (Q5362278) (← 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)
- Truth table invariant cylindrical algebraic decomposition (Q5963392) (← links)
- Explainable AI insights for symbolic computation: a case study on selecting the variable ordering for cylindrical algebraic decomposition (Q6149145) (← links)
- Levelwise construction of a single cylindrical algebraic cell (Q6149151) (← links)
- Polynomial Superlevel Set Representation of the Multistationarity Region of Chemical Reaction Networks (Q6336905) (← links)
- Clustering in the Lazard method for cylindrical algebraic decomposition (Q6536598) (← links)
- An iterated greedy algorithm with variable reconstruction size for the obnoxious \(p\)-median problem (Q6609705) (← links)
- Symbolic integration algorithm selection with machine learning: LSTMs vs tree LSTMs (Q6637807) (← 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)
- Recent developments in real quantifier elimination and cylindrical algebraic decomposition (extended abstract of invited talk) (Q6660310) (← links)
