Random strings make hard instances
Author:
Buhrman H.,Orponen P.
Publisher
IEEE Comput. Soc. Press
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On hard instances;Theoretical Computer Science;2000-07
2. An Excursion to the Kolmogorov Random Strings;Journal of Computer and System Sciences;1997-06
3. NP-hard sets have many hard instances;Mathematical Foundations of Computer Science 1997;1997
4. Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets;SIAM Journal on Computing;1996-12
5. On resource-bounded instance complexity;Theoretical Computer Science;1996-07