Space-smallness

Space-Smallness is a theoretical construct in computational complexity theory that characterizes the minimal asymptotic space required by a deterministic Turing machine to solve a decision problem, distinguished by its focus on sublinear space bounds inherently smaller than the input size.

8

Publications

297

Citations

15

Authors

10

Institutions

Publications per year

2017–2026

0

Authors

15

  1. MT
    Martin Tompa

    University of Washington, United States

    2 publications · 33 citations

    2

    h-index

  2. JP
    Jakob Pagter

    Aarhus University, Denmark

    1 publications · 12 citations

    1

    h-index

  3. RB
    Reinhard Bauer

    Karlsruhe Institute of Technology, Germany

    1 publications · 23 citations

    1

    h-index

  4. KM
    Kurt Mehlhorn

    Max Planck Institute for Informatics, Germany

    1 publications · 23 citations

    1

    h-index

  5. VL
    V.I. Levenshtein

    Keldysh Institute of Applied Mathematics, Russia

    1 publications · 39 citations

    1

    h-index

1–5 of 15

Venues

  1. SIAM Journal on Computing

    2 publications · 166 citations

    2

    h-index

  2. Topology

    1 publications · 24 citations

    1

    h-index

  3. Information Processing Letters

    1 publications · 10 citations

    1

    h-index

  4. Discrete Mathematics

    1 publications · 39 citations

    1

    h-index

  5. BRICS Report Series

    1 publications · 12 citations

    1

    h-index

1–5