A.V. Naik, K.W. Regan, and D. Sivakumar, "Quasilinear-time complexity theory," Theoretical Computer Science, to appear. Home/Search Document Details and Download
Context Related Articles Check |
This paper is cited by the following papers:
Sharply Bounded Alternation within P - Bloch, Buss, Goldsmith (1996) (2 citations) (Correct)
Persistent Computations - Kosub (1998) (1 citation) (Correct)
Sharply Bounded Alternation and Quasilinear Time - Bloch, Buss, Goldsmith (1997) (Correct)
Data-Independence of Read, Write, and Control Structures in .. - Lange, Niedermeier (1998) (Correct)
Non-Commutative Arithmetic Circuits: Depth Reduction and.. - Allender, Jiao, al. (1996) (6 citations) (Correct)
Sharply Bounded Alternation within P - Bloch (1995) (2 citations) (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