1. S. A. Cook, The complexity of theorem-proving procedures.Proc. 3rd Annual ACM Symp. on Theory of Computing, May, 1971.
2. R. M. Karp, Reducibility among combinatorial problems, inComplexity of Computer Computations, (R. E. Miller and J. W. Thatcher, eds.), Plenum Press, New York, 1972.
3. A. R. Meyer, Weak monadic second order of successor is not elementary recursive-preliminary report (unpublished).
4. M. J. Fischer andM. O. Rabin, Super-exponential complexity of Presburger arithmetic,SIAM-AMS Proc., vol. 7, Amer. Math. Soc., Providence, R.I., 1974.
5. L. J. Stockmeyer andA. R. Meyer, World problems requiring exponential time: preliminary report,Proc. 5th Annual ACM Symp. on Theory of Computing, May, 1973.