Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference22 articles.
1. L. Berman, 1977, Polynomial Reducibilities and Complete Sets, Cornell University
2. L. Berman, J. Hartmanis, 1976, On isomorphism and density of NP and other complete sets, Proceedings of the 8th ACM Symposium on the Theory of Computing, 30, 40, ACM, New York
3. On isomorphism and density of NP and other complete sets;Berman;SIAM J. Computing,1977
4. M. Dowd, 1978, On isomorphism
5. The isomorphism conjecture hold relative to an oracle;Fenner;SIAM J. Computing,1996
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Beautiful structures;ACM SIGACT News;2014-09-17
2. An oracle builder’s toolkit;Information and Computation;2003-05
3. Two Queries;Journal of Computer and System Sciences;1999-10
4. Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem;Journal of Computer and System Sciences;1998-10
5. A hierarchy based on output multiplicity;Theoretical Computer Science;1998-10