EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 27 / No 4 (1993) RAIRO-Theor. Inf. Appl., 27 4 (1993) 349-366 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 27, Number 4, 1993
Page(s) 349 - 366
DOI https://doi.org/10.1051/ita/1993270403491
Published online 01 February 2017
  1. 1. P. van EMDE BOAS, Machine models and simulations, I.T.L.I. Prepublication Series for Computation and Complexity Theory, CT-89-02, to appear in: J. van Leeuwen (ed): Handbook of Theoretical Computer Science, North-Holland. [MR: 1127167] [Zbl: 0900.68265] [Google Scholar]
  2. 2. A. K. CHANDRA, D. KOZEN, L. J. STOCKMEYER, Alternation, J. Assoc. Comput. Mach., 1981, 28, pp. 114-133. [MR: 603186] [Zbl: 0473.68043] [Google Scholar]
  3. 3. A. K. CHANDRA and L. J. STOCKMEYER, Alternation, Proc. of 17th I.E.E.E.-F.O.C.S., 1976, pp. 98-108. [MR: 520888] [Google Scholar]
  4. 4. J. H. CHANG, O. H. IBARRA, B. RAVIKUMAR, and L. BERMAN, Some observations concerning alternating Turing machines using small space, Inform. Process. Lett., 1987, 25, pp. 1-9 (Erratum: 27 (1988), 53). [MR: 896396] [Zbl: 0635.68040] [Google Scholar]
  5. 5. A. R. FREEDMAN and R. E. LADNER, Space bounds for processing counterless inputs, J. Comput. Syst. Sciences, 1975, 11, pp. 118-128. [MR: 398161] [Zbl: 0307.68036] [Google Scholar]
  6. 6. V. GEFFERT, Nondeterministic computations in sublogarithmic space and space constructibility, S.I.A.M. J. Comput., 1991, 20, No. 3, pp. 484-498. [MR: 1094527] [Zbl: 0762.68022] [Google Scholar]
  7. 7. N. IMMERMAN, Nondeterministic space is closed under complement, S.I.A.M. J. Comput., 1988, 17, pp. 935-938. [MR: 961049] [Zbl: 0668.68056] [Google Scholar]
  8. 8. B. JENNER, B. KIRSIG, and K. LANGE, The logarithmic alternation hierarchy collapses: A∑L2 = AπL2, Information and Computation, 1989, 80, pp. 269-288. [MR: 984485] [Zbl: 0668.68055] [Google Scholar]
  9. 9. D. KOZEN, On parallelism in Turing machines, 17th I.E.E.E.-F.O.C.S., 1976, pp. 89-97. [MR: 464696] [Google Scholar]
  10. 10. D. RANJAN, R. CHANG, and J. HARTMANIS, Space bounded computations: Review and new separation results, Theoret. Comp. Sci., 1991, 80, pp. 289-302. [MR: 1117067] [Zbl: 0745.68051] [Google Scholar]
  11. 11. U. SCHONING and K. WAGNER, Collapsing oracle hierarchies, census functions, and logarithmically many queries, Proc. of STACS'88, Springer-Verlag, LNCS 294, 1988, pp. 91-97. [MR: 935790] [Zbl: 0648.68065] [Google Scholar]
  12. 12. J. SEIFERAS, A note on notions of tape constructibility, Technical Report CSD-TR-187, Pennsylvania State University, 1976. [Google Scholar]
  13. 13. M. SIPSER, Halting space bounded computations, Theoret. Comp. Sci., 1980, 10, pp. 335-338. [MR: 559693] [Zbl: 0423.68011] [Google Scholar]
  14. 14. R. E. STEARNS, J. HARTMANIS, and P. M. LEWIS II, Hierarchies of memory limited computations, In 1965 I.E.E.E. Conference Record on Switching Circuit Theory and Logical Design, 1965, pp. 179-190. [Zbl: 0229.02033] [Google Scholar]
  15. 15. R. SZELEPCSÉNYI, The method of forced enumeration for nondeterministic automata, Acta Informatica, 1988, 26, pp. 279-284. [MR: 975334] [Zbl: 0638.68046] [Google Scholar]
  16. 16. A. SZEPIETOWSKI, Some remarks on the alternating hierarchy and closure under complement for sublogarithmic space, Information Processing Letters, 1989, 33, pp. 73-78. [MR: 1031596] [Zbl: 0684.68062] [Google Scholar]
  17. 17. S. TODA, ∑2-SPACE(n) is closed under complement, J. Comput. Syst. Sciences, 1987, 35, pp. 145-152. [MR: 910209] [Zbl: 0654.68053] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.