Pages that link to "Item:Q1036531"

The following pages link to Computational bounds on polynomial differential equations (Q1036531):

Displaying 20 items.

• Computational complexity of solving polynomial differential equations over unbounded domains (Q264572) (← links)
• Computing with polynomial ordinary differential equations (Q306694) (← links)
• Lipschitz continuous ordinary differential equations are polynomial-space complete (Q626672) (← links)
• Using a computer to obtain strict bounds on solutions of differential equations (Q1177593) (← links)
• Polynomial interpolation and a priori bootstrap for computer-assisted proofs in nonlinear ODEs (Q1670296) (← links)
• Computability of ordinary differential equations (Q1670741) (← links)
• On the universality of potential well dynamics (Q1692416) (← links)
• Computability in planar dynamical systems (Q1761693) (← links)
• Computational complexity of real powering and improved solving linear differential equations (Q2330561) (← links)
• Polynomial differential equations compute all real computable functions on computable compact intervals (Q2371306) (← links)
• Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time (Q2431341) (← links)
• Computability with polynomial differential equations (Q2482915) (← links)
• Numerical solutions of index-1 differential algebraic equations can be computed in polynomial time (Q2492797) (← links)
• Computability and Dynamical Systems (Q2908425) (← links)
• Bounds for Orders of Derivatives in Differential Elimination Algorithms (Q2985833) (← links)
• Axiomatizing Analog Algorithms (Q3188259) (← links)
• Undecidable event detection problems for ODEs of dimension one and two (Q4348239) (← links)
• Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs (Q4918029) (← links)
• A Universal Ordinary Differential Equation (Q5109517) (← links)
• Robust non-computability of dynamical systems and computability of robust dynamical systems (Q6597950) (← links)