B. Trakhtenbrot. Turing computations with logarithmic delay. Algebra i Logika, 3:33--48, 1964. 37 Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
A Short History of Computational Complexity - Fortnow, Homer (2002) (Correct)
Levin, Blum and the Time Optimality of Programs - Christensen (1999) (Correct)
Reductions in Circuit Complexity: An Isomorphism Theorem.. - Agrawal, Allender, al. (1997) (3 citations) (Correct)
Complexity Classes - Allender, Loui, Regan (Correct)
Complexity Classes - Allender, Loui, Regan (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC