Journal of the ACM Bibliography
Jose L.
Balcázar, Ronald
V. Book, and Uwe
Schöning. The polynomial-time hierarchy and sparse oracles.
Journal of the ACM, 33(3):603-617, July 1986.
[BibTeX entry]
Selected papers that cite this one
- Ronald V. Book, Jack H. Lutz, and Klaus W. Wagner. An observation on
probability versus randomness with applications to complexity
classes. Mathematical Systems Theory, 27(3):201-209,
May/June 1994.
- Daniel P. Bovet, Pierluigi Crescenzi, and Riccardo Silvestri. Complexity classes and
sparse oracles. Journal of Computer and System
Sciences, 50(3):382-390, June 1995.
- Ricard Gavalda. Bounding the complexity
of advice functions. Journal of Computer and System
Sciences, 50(3):468-475, June 1995.
- Judy Goldsmith, Deborah Joseph, and Paul Young. Using self-reducibilities to
characterize polynomial time. Information and
Computation, 104(2):288-308, June 1993.
- Yenjo Han, Lane A. Hemaspaandra, and Thomas Thierauf. Threshold computation
and cryptography security. SIAM Journal on Computing,
26(1):59-78, January 1997.
- Lane A. Hemaspaandra and Jörg Rothe. Unambiguous
computation: Boolean hierarchies and sparse Turing-complete sets.
SIAM Journal on Computing, 26(3):634-653, June 1997.
- Shouwen Tang and Osamu Watanabe. On tally
relativizations of BP-complexity classes. SIAM
Journal on Computing, 18(3):449-462, June 1989.
Shortcuts: