Journal of the ACM Bibliography
Nancy
Lynch. On reducibility to complex or sparse sets. Journal of
the ACM, 22(3):341-345, July 1975.
[BibTeX entry]
Selected papers that cite this one
- David W. Juedes and Jack H. Lutz. The complexity and
distribution of hard problems (extended abstract). In 34th
Annual Symposium on Foundations of Computer Science, pages
177-185, Palo Alto, California, 3-5 November 1993. IEEE.
- David W. Juedes and Jack H. Lutz. The complexity and
distribution of hard problems. SIAM Journal on
Computing, 24(2):279-295, April 1995.
- David W. Juedes and Jack H. Lutz. Completeness and weak completeness
under polynomial-size circuits. Information and
Computation, 125(1):13-31, 25 February 1996.
- Jack H. Lutz. Weakly hard
problems. SIAM Journal on Computing, 24(6):1170-1189,
December 1995.
- Pekka Orponen, Ker-I Ko, Uwe Schöning, and Osamu Watanabe. Instance complexity.
Journal of the ACM, 41(1):96-121, January 1994.
Shortcuts: