Logarithmic Space

Logarithmic Space is the complexity class consisting of decision problems solvable by a deterministic Turing machine using a workspace bounded by a logarithmic function of the input size.

145

Publications

8.9K

Citations

271

Authors

155

Institutions

Publications per year

2017–2026

20

Variants

Logspace

Authors

271

  1. SS
    Stevo Stević

    Serbian Academy of Sciences and Arts, Serbia

    6 publications · 272 citations

    6

    h-index

  2. VG
    Viliam Geffert

    University of Pavol Jozef Šafárik, Slovakia

    5 publications · 133 citations

    5

    h-index

  3. SC
    Stephen Cook

    University of Toronto, Canada

    3 publications · 311 citations

    3

    h-index

  4. PM
    Pierre McKenzie

    Université de Montréal, Canada

    3 publications · 219 citations

    3

    h-index

  5. HB
    Harry Buhrman

    Centrum Wiskunde & Informatica, Netherlands

    3 publications · 97 citations

    3

    h-index

1–5 of 271

Venues

  1. arXiv (Cornell University)

    Repository · 9 publications · 126 citations

    9

    h-index

  2. SIAM Journal on Computing

    9 publications · 289 citations

    9

    h-index

  3. Theory of Computing Systems

    6 publications · 364 citations

    6

    h-index

  4. Information and Computation

    6 publications · 106 citations

    5

    h-index

  5. Applied Mathematics and Computation

    4 publications · 171 citations

    4

    h-index

1–5