Turing Machine Space Bounds

Turing Machine Space Bounds is a theoretical construct in computational complexity theory that specifies the maximum amount of tape space a Turing machine requires to decide a language as a function of the input size, distinguishing it from time-based or circuit-based complexity measures.

40

Publications

2K

Citations

55

Authors

40

Institutions

Publications per year

2017–2026

0

Authors

55

  1. ÓH
    Óscar H. Ibarra

    University of California, Santa Barbara, United States

    4 publications · 79 citations

    4

    h-index

  2. SC
    Stephen Cook

    University of Toronto, Canada

    3 publications · 251 citations

    3

    h-index

  3. HC
    Hubert Comon

    Centre National de la Recherche Scientifique, France

    2 publications · 58 citations

    2

    h-index

  4. PB
    Paul Beame

    University of Washington, United States

    2 publications · 93 citations

    2

    h-index

  5. GM
    Giancarlo Mauri

    University of Milano-Bicocca, Italy

    2 publications · 38 citations

    2

    h-index

1–5 of 55

Venues

  1. SIAM Journal on Computing

    9 publications · 644 citations

    9

    h-index

  2. Mathematical logic quarterly

    MLQ · 2 publications · 75 citations

    2

    h-index

  3. Information Sciences

    2 publications · 44 citations

    2

    h-index

  4. Journal of the ACM

    JACM · 2 publications · 308 citations

    2

    h-index

  5. Theoretical Computer Science

    2 publications · 49 citations

    2

    h-index

1–5