On the computational complexity of ordinary differential equations
Open Access
- 30 September 1983
- journal article
- Published by Elsevier in Information and Control
- Vol. 58 (1-3) , 157-194
- https://doi.org/10.1016/s0019-9958(83)80062-x
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- On self-reducibility and weak P-selectivityJournal of Computer and System Sciences, 1983
- Computational complexity of real functionsTheoretical Computer Science, 1982
- A computable ordinary differential equation which possesses no computable solutionAnnals of Mathematical Logic, 1979
- An analysis of alpha-beta pruningArtificial Intelligence, 1975
- Tally languages and complexity classesInformation and Control, 1974
- Recursive function theory and numerical analysisJournal of Computer and System Sciences, 1970
- The primitive recursive analysis of ordinary differential equations and the complexity of their solutionsJournal of Computer and System Sciences, 1969