Subject
General Computer Science,Theoretical Computer Science
Reference27 articles.
1. On the theory of average case complexity;Ben-David;J. Comput. System Sci.,1992
2. Proc. 21st Ann. Symp. on Theory of Computing;Ben-David,1989
3. Randomizing reductions of search problems;Blass;SIAM J. Comput.,1993
4. Matrix transformation is complete for the average case;Blass;SIAM J. Comput.,1995
5. On isomorphisms and density of NP and other complete sets;Berman;SIAM J. Comput.,1977
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Distributional Word Problem for Groups;SIAM Journal on Computing;1999-01
2. Average-Case Intractable NP Problems;Advances in Algorithms, Languages, and Complexity;1997
3. Average-Case Computational Complexity Theory;Complexity Theory Retrospective II;1997