메뉴 건너뛰기




Volumn 1178, Issue , 1996, Pages 193-202

StUSPA CE(log n) ⊆ DSPA CE(log2n / log log n)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

EID: 84990219556     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0009495     Document Type: Conference Paper
Times cited : (3)

References (23)
  • 2
    • 0002967460 scopus 로고
    • On the unique satisfiability problem
    • A. Blass and Y. Gurevich. On the unique satisfiability problem. Inform. and Control, 55:80-88, 1982.
    • (1982) Inform. and Control , vol.55 , pp. 80-88
    • Blass, A.1    Gurevich, Y.2
  • 4
    • 0023952675 scopus 로고
    • Approximate parallel scheduling, part i: The basic technique with applications to optimal parallel list ranking in logarithmic time
    • R. Cole and U. Vishkin. Approximate parallel scheduling, part i: the basic technique with applications to optimal parallel list ranking in logarithmic time. SIAM J. Comp. 17:128-142, 1988.
    • (1988) SIAM J. Comp , vol.17 , pp. 128-142
    • Cole, R.1    Vishkin, U.2
  • 5
    • 84880698085 scopus 로고
    • Deterministic CFL’s are accepted simultaneously in polynomial time and log squared space
    • S. Cook. Deterministic CFL’s are accepted simultaneously in polynomial time and log squared space. In Proc. of the 11th Annual ACM Syrup. on Theory of Computing, pages 338-345, 1979.
    • (1979) Proc. of the 11Th Annual ACM Syrup. on Theory of Computing , pp. 338-345
    • Cook, S.1
  • 11
    • 0024091298 scopus 로고
    • Nondeterministic Space is closed under complementation
    • N. Immerman. Nondeterministic Space is closed under complementation. SIAM J. Comp., 17:935-938, 1988.
    • (1988) SIAM J. Comp , vol.17 , pp. 935-938
    • Immerman, N.1
  • 13
    • 0002065879 scopus 로고
    • A Survey of Parallel Algorithms for Shared- Memory Machines
    • J. van Leeuwen, editor, Elsevier, Amsterdam
    • R.M. Karp and V. Ramachandran. A Survey of Parallel Algorithms for Shared- Memory Machines. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. A, pages 869-941. Elsevier, Amsterdam, 1990.
    • (1990) Handbook of Theoretical Computer Science , vol.A , pp. 869-941
    • Karp, R.M.1    Ramachandran, V.2
  • 17
    • 0027644646 scopus 로고
    • Fast recognition of deterministic cfl's with a smaller number of processors
    • Corrigendum
    • B. Monien, W. Rytter, and H. Schäpers. Fast recognition of deterministic cfl's with a smaller number of processors. Theoret. Comput. Sci., 116:421-429, 1993. Corrigendum, 123:427,1993.
    • (1993) Theoret. Comput. Sci , vol.116 , pp. 421-429
    • Monien, B.1    Rytter, W.2    Schäpers, H.3
  • 21
    • 84976758731 scopus 로고
    • On the tape complexity of deterministic context-free languages
    • I. Sudborough. On the tape complexity of deterministic context-free languages. J. Assoc. Comp. Mach., 25:405-414, 1978.
    • (1978) J. Assoc. Comp. Mach , vol.25 , pp. 405-414
    • Sudborough, I.1
  • 22
    • 0024112189 scopus 로고
    • The method of forcing for nondeterministic automata
    • R. Szelepcsényi. The method of forcing for nondeterministic automata. Acta Informatica, 26:279-284, 1988.
    • (1988) Acta Informatica , vol.26 , pp. 279-284
    • Szelepcsényi, R.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.