Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
Relating the Computational and Logical Difficulty of Solving ODEs: From Polynomial to Discontinuous Right-Hand Sides
Saved in:
| Published in: | ArXiv cs.CC Recent Papers |
|---|---|
| Format: | Online Article RSS Article |
| Published: |
2026
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
Similar Items: Relating the Computational and Logical Difficulty of Solving ODEs: From Polynomial to Discontinuous Right-Hand Sides
- Primitive Recursion without Composition: Dynamical Characterizations, from Neural Networks to Polynomial ODEs
- On Sampling Lower Bounds for Polynomials
- Polynomial-time completion of phylogenetic tree sets
- Maximum Matching and Related Problems in Catalytic Logspace
- A Critical Comment on 'Entropy Computing: A Paradigm for Optimization in Open Photonic Systems'
- The Exact Replica Threshold for Nonlinear Moments of Quantum States