Logspace Reductions

Logspace Reductions is a type of computational reduction in complexity theory where a problem is transformable to another problem using a logarithmic amount of workspace relative to the input size, thereby preserving membership in complexity classes such as P and NL.

26

Publications

891

Citations

52

Authors

30

Institutions

Publications per year

2017–2026

2

Variants

Log-space Reductions

Authors

52

  1. IA
    Iain A. Stewart

    Durham University, United Kingdom

    3 publications · 73 citations

    3

    h-index

  2. UH
    Ulrich Hertrampf

    University of Würzburg, Germany

    2 publications · 143 citations

    2

    h-index

  3. AN
    Arfst Nickelsen

    Technische Universität Berlin, Germany

    1 publications · 11 citations

    1

    h-index

  4. VS
    Vladimir Sazonov

    Program Systems Institute of RAS, Russia

    1 publications · 14 citations

    1

    h-index

  5. C�
    Carme �lvarez

    Universitat Politècnica de Catalunya, Spain

    1 publications · 13 citations

    1

    h-index

1–5 of 52

Venues

  1. Theory of Computing Systems

    4 publications · 280 citations

    4

    h-index

  2. Information Processing Letters

    3 publications · 46 citations

    3

    h-index

  3. SIAM Journal on Computing

    2 publications · 50 citations

    2

    h-index

  4. Journal of Logic and Computation

    2 publications · 63 citations

    2

    h-index

  5. Theoretical Computer Science

    1 publications · 14 citations

    1

    h-index

1–5