External Links

    Journal: J. Comput. Syst. Sci.

    Volume 7, Issue 4

    334 -- 342H. T. Kung. A Bound on the Multiplicative Efficiency of Iteration
    343 -- 353Stephen A. Cook. A Hierarchy for Nondeterministic Time Complexity
    354 -- 375Stephen A. Cook, Robert A. Reckhow. Time Bounded Random Access Machines
    376 -- 388Claus-Peter Schnorr. Process Complexity and Effective Random Tests
    389 -- 403Walter J. Savitch. Maze Recognizing Automata and Nondeterministic Tape Complexity
    404 -- 447S. A. Walker, H. Raymond Strong. Characterizations of Flowchartable Recursions
    448 -- 461Manuel Blum, Robert W. Floyd, Vaughan R. Pratt, Ronald L. Rivest, Robert Endre Tarjan. Time Bounds for Selection
    runs on