Pages that link to "Item:Q2110661"
From MaRDI portal
The following pages link to On the complexity of quadratization for polynomial differential equations (Q2110661):
Displaying 10 items.
- Computational complexity of solving polynomial differential equations over unbounded domains (Q264572) (← links)
- Computational bounds on polynomial differential equations (Q1036531) (← links)
- Algebraic biochemistry: a framework for analog online computation in cells (Q2112135) (← links)
- Optimal monomial quadratization for ODE systems (Q2115847) (← links)
- Compiling elementary mathematical functions into finite chemical reaction networks via a polynomialization algorithm for ODEs (Q2142105) (← links)
- Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time (Q2431341) (← links)
- Design of quadrature rules for Müntz and Müntz-logarithmic polynomials using monomial transformation (Q3549824) (← links)
- Economical symmetrical quadrature rules for complete polynomials over a square domain (Q3719708) (← links)
- (Q4648391) (← links)
- Quasi-exact solvability in a general polynomial setting (Q5424714) (← links)