Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science
Reference4 articles.
1. P. C. Fischer, “Theory of provable functions,”Trans. Amer. Math. Soc. 117, 494–520 (1965).
2. J. Hartmanis, “Relations between diagonalization, proof systems, and complexity gaps,”Proceedings of the Ninth Annual ACM Symposium on Theory of Computing, Boulder, Colorado, 223–227 (1977).
3. H. Rogers, Jr.,Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967.
4. P. R. Young, “Optimization among provably equivalent programs,”J. Assoc. Comput. Mach. 24, 693–700 (1977).
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献