1. The failure in computable analysis of a classical existence theorem for differential equations;Aberth,1971
2. Tally languages and complexity classes;Book;Inform. Contr.,1974
3. The primitive recursive analysis of ordinary differential equations and the complexity of their solutions;Cleave;J. Comput. System Sci.,1969
4. On the computational complexity of maximization and integration;Freidman;Adv. in Appl. Math.,1984
5. Computers and Intractability;Garey,1979