Journal of the ACM Bibliography
Joel I. Seiferas, Michael J. Fischer, and Albert R. Meyer.
Separating nondeterministic time complexity classes. Journal of
the ACM, 25(1):146-167, January 1978.
[BibTeX entry]
Selected papers that cite this one
- Eric Allender and Vivek Gore. A uniform
circuit lower bound for the permanent. SIAM Journal on
Computing, 23(5):1026-1049, October 1994.
- Bin Fu, Hong-zhou Li, and Yong Zhong. An application of the
translational method. Mathematical Systems Theory,
27(2):183-186, March/April 1994.
- Etienne Grandjean. Complexity of the first-order
theory of almost all finite structures. Information and
Control, 57(2/3):180-204, May/June 1983.
- S. Gupta. Alternating time versus
deterministic time: A separation. Mathematical Systems
Theory, 29(6):661-672, November/December 1996.
- Nicholas Tran. On P-immunity of
exponential time complete sets. Journal of Computer and System
Sciences, 54(3):437-440, June 1997.
Shortcuts: