Author:
Joseph Deborah,Young Paul
Publisher
Springer Berlin Heidelberg
Reference52 articles.
1. Adleman, L. and Manders, K., "Computational complexity of decision procedures for polynomials," Proceedings of the 17th Annual IEEE Symp on Switching and Automata Theory, pp. 169–177 (1976).
2. Baker, T. P., "On ‘provable’ analogs of P and NP," Math Systems Theory Vol. 12 pp. 213–218 (1979).
3. Berman, L. and Hartmanis, J., "On the isomorphism and density of NP and other complete sets," SIAM J Comput Vol. 6 pp. 305–322 (Dec 1977).
4. Blum, M., "A machine independent theory of the complexity of the recursive functions," J Association Comput Mach Vol. 14(2) pp. 322–336 (1967).
5. Brainerd, W. and Landweber, L., Theory of Computation, John Wiley & Sons, New York (1974).
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献