Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. S. Ben-David, B. Chor, O. Goldreich, and M. Luby. On the theory of average case complexity. J. Comp. Sys. Sci., 44:193–219, 1992.
2. A. Blass and Y. Gurevich. Randomizing reductions of decision problems (tentative title). Personal communication.
3. A. Blass and Y. Gurevich. Randomizing reductions of search problems. SIAM J. Comput., 22:949–975, 1993.
4. A. Blass and Y. Gurevich. Matrix decomposition is complete for the average case. SIAM J. Comput., 1994. to appear.
5. L. Berman and J. Hartmanis. On isomorphisms and density of NP and other complete sets. SIAM J. Comput., 6:305–321, 1977.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献