Author:
Fortnow Lance,Kummer Martin
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. J. Balcázar, J. Diaz, J. Gabarró. Structural complexity I, II. Spinger-Verlag, Berlin, 1988, 1990.
2. H. Buhrman, P. Orponen. Random strings make hard instances. In: Proceedings Structure in Complexity Theory, Ninth Annual Conference, 217–222, 1994.
3. J. Hartmanis. Generalized Kolmogorov complexity and the structure of feasible computation. In: Proc. 24th IEEE Symp. Foundations of Computer Science, pp. 439–445, 1983.
4. S. Homer, L. Longpré. On reductions of NP sets to sparse sets. Journal of Computer and System Sciences 48, 324–336, 1994.
5. K. Ko. A note on the instance complexity of pseudorandom sets. In: Proceedings Structure in Complexity Theory, Seventh Annual Conference, pp. 327–337, 1992.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献