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
Parents
26
Structure and importance of logspace-MOD class
Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf et al. · Theory of Computing Systems · 1992 · 121 citations
A logspace algorithm for tree canonization (extended abstract)
Steven Lindell · 1992 · 85 citations
1–5 of 26
52
3
h-index
2
h-index
1
h-index
1
h-index
1
h-index
1–5 of 52
30
Stanford University
Stanford, United States
5 h-index
6 publications
255 citations
Goethe University Frankfurt
Frankfurt am Main, Germany
2 h-index
2 publications
56 citations
Hebrew University of Jerusalem
Jerusalem, Israel
2 h-index
3 publications
49 citations
University of Würzburg
Würzburg, Germany
2 h-index
4 publications
286 citations

Newcastle University
Newcastle upon Tyne, United Kingdom
2 h-index
2 publications
43 citations

University of Rochester
Rochester, United States
2 h-index
2 publications
29 citations
Charles University
Prague, Czechia
1 h-index
1 publications
21 citations
New York University
New York, United States
1 h-index
2 publications
44 citations
1–8 of 30
4 publications · 280 citations
4
h-index
3 publications · 46 citations
3
h-index
2 publications · 50 citations
2
h-index
2 publications · 63 citations
2
h-index
1 publications · 14 citations
1
h-index
1–5