The following pages link to James H. Davenport (Q247220):
Displaying 50 items.
- (Q174250) (redirect page) (← links)
- (Q1894536) (redirect page) (← links)
- Cylindrical algebraic sub-decompositions (Q475412) (← links)
- Improvements to quantum search techniques for block-ciphers, with applications to AES (Q832355) (← links)
- The freedom to extend OpenMath and its utility (Q841695) (← links)
- Testing elementary function identities using CAD (Q944998) (← links)
- An application of factoring (Q1081302) (← links)
- Computer algebra applied to itself (Q1106662) (← links)
- Elementary and Liouvillian solutions of linear differential equations (Q1106886) (← links)
- Real quantifier elimination is doubly exponential (Q1114669) (← links)
- On the integration of algebraic functions (Q1157366) (← links)
- Equality in computer algebra and beyond. (Q1404423) (← links)
- Reasoning about the elementary functions of complex analysis (Q1610222) (← links)
- TheoryGuru: a Mathematica package to apply quantifier elimination technology to economics (Q1662274) (← links)
- What does ``without loss of generality'' mean, and how do we detect it (Q1701639) (← links)
- The ``unknown'' in computer algebra (Q1894538) (← links)
- Computing with semi-algebraic sets: relaxation techniques and effective boundaries (Q1940931) (← 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)
- Identifying the parametric occurrence of multiple steady states for some biological networks (Q2284952) (← links)
- Cylindrical algebraic decomposition with equational constraints (Q2307622) (← links)
- (Q2767936) (← links)
- $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation (Q2817292) (← links)
- Need Polynomial Systems Be Doubly-Exponential? (Q2819212) (← links)
- Complexity of Integration, Special Values, and Recent Developments (Q2819268) (← 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)
- Speeding Up Cylindrical Algebraic Decomposition by Gröbner Bases (Q2907329) (← links)
- Cylindrical algebraic decompositions for boolean combinations (Q2963225) (← links)
- (Q3156395) (← links)
- On finding the largest root of a polynomial (Q3201651) (← links)
- (Q3219759) (← links)
- (Q3219760) (← links)
- (Q3325027) (← links)
- On the parallel Risch algorithm (III) (Q3325028) (← links)
- (Q3339160) (← links)
- Short Notes: Factoring Medium-Sized Integers (Q3340914) (← links)
- Polynomials whose powers are sparse (Q3353091) (← links)
- Recent Advances in Real Geometric Reasoning (Q3452275) (← links)
- An exact real algebraic arithmetic with equality determination (Q3454759) (← links)
- A Remark on a Paper by Wang: Another Surprising Property of 42 (Q3476904) (← links)
- Algebraic properties of the Lambert<i>W</i>function from a result of Rosenlicht and of Liouville (Q3541147) (← links)
- The Challenges of Multivalued “Functions” (Q3582691) (← links)
- A Comparison of Equality in Computer Algebra and Correctness in Mathematical Pedagogy (Q3637270) (← links)
- Unifying Math Ontologies: A Tale of Two Standards (Q3637283) (← links)
- Certificate-Free Attribute Authentication (Q3654625) (← links)
