Journal of the ACM Bibliography
C. P. Schnorr.
Satisfiability is quasilinear complete in NQL. Journal of the
ACM, 25(1):136-145, January 1978.
[BibTeX entry]
Selected papers that cite this one
- Stephen Bloch. On parallel hierarchies
and R^i_k. Annals of Pure and
Applied Logic, 89(2-3):231-273, 8 December 1997.
- S. A. Bloch, J. F. Bruss, and J. Goldsmith. Sharply bounded
alternation and quasilinear time. Theory of Computing
Systems, 31(2):187-214, March/April 1998.
- Etienne Grandjean. Linear time
algorithms and NP-complete problems. SIAM Journal on
Computing, 23(3):573-597, June 1994.
- Etienne Grandjean and Hans Kleine Büning. SAT-problems and
reductions with respect to the number of variables. Journal of
Logic and Computation, 7(4):457-471, August 1997.
- Kenneth W. Regan. Linear time and
memory-efficient computation. SIAM Journal on
Computing, 25(1):133-168, February 1996.
Shortcuts: