1. S. Wolfram:Phys. Rev. Lett.,54, 735 (1985);55, 449 (1985).
2. R. P. Brent:The computational complexity of iterative methods for systems of non-linear equations, inComplexity Symposium, edited byR. E. Miller andJ. W. Thatcher (Plenum Press, New York, N.Y., 1972);B. Kacewics andH. Wozniakowski:A survey of recent problems and results in analytic computational complexity, inMathematical Foundations of Computer Science 77, edited byJ. Gruska:Lecture Notes in Computer Science, N.53 (Springer-Verlag, Berlin, 1977).
3. M. Garey andD. Johnson:Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, Cal. 1979).
4. S. Smale:Diffeomorphisms with many periodic points, inDifferential and Combinatorial Topology, edited byS. S. Cairns (Princeton University Press, Princeton, N.J., 1965).
5. S. Smale:Bull. Am. Math. Soc.,73, 747 (1967).