Space Reductions

Space Reductions is a computational method that belongs to the class of complexity-theoretic reductions, specifically distinguished by its requirement that the transformation between problems must be computable within bounded space, preserving the resource constraints central to space complexity analysis.

73

Publications

3.7K

Citations

169

Authors

113

Institutions

Publications per year

2017–2026

17

Variants

Space-bounded Reductions

Authors

169

  1. AJ
    Artur Jeż

    University of Wrocław, Poland

    3 publications · 61 citations

    3

    h-index

  2. RF
    Roy Friedman

    Technion – Israel Institute of Technology, Israel

    2 publications · 111 citations

    2

    h-index

  3. GE
    Gil Einziger

    Technion – Israel Institute of Technology, Israel

    2 publications · 111 citations

    2

    h-index

  4. GE
    Giulio Ermanno Pibiri

    Istituto di Scienza e Tecnologie dell'Informazione "Alessandro Faedo", Italy

    2 publications · 46 citations

    2

    h-index

  5. PM
    Philip M. Long

    National University of Singapore, Singapore

    2 publications · 37 citations

    2

    h-index

1–5 of 169

Venues

  1. Journal of Computer and System Sciences

    3 publications · 441 citations

    3

    h-index

  2. 3

    h-index

  3. ACM Transactions on Information Systems

    2 publications · 46 citations

    2

    h-index

  4. Pattern Recognition

    2 publications · 106 citations

    2

    h-index

  5. Computers & Chemical Engineering

    2 publications · 136 citations

    2

    h-index

1–5