Author:
Blass Andreas,Gurevich Yuri
Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. Shai Ben-David, Benny Chor, Oded Goldreich and Michael Luby, “On the Theory of Average Case Complexity”, Symposium on Theory of Computing, ACM, 1989, 204–216.
2. Yuri Gurevich, “Average Case Complexity”, J. Computer and System Sciences (a special issue on FOCS'87) to appear.
3. Yuri Gurevich, “Matrix Decomposition Problem is Complete for the Average Case”, Symposium on Foundations of Computer Science, IEEE Computer Society Press, 1990, 802–811.
4. [GJ]Michael R. Garey and David S. Johnson, “Computers and Intractability: A Guide to the Theory of NP-Completeness”, Freeman, New York, 1979.
5. Russel Impagliazzo and Leonid A. Levin, “No Better Ways to Generate Hard NP Instances than Picking Uniformly at Random”, Symposium on Foundations of Computers Science, IEEE Computer Soviety Press, 1990, 812–821.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献