BibTeX
@MISC{Schubert00thecomplexity,
author = {Aleksy Schubert},
title = {The complexity of β-reduction in low orders},
year = {2000}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We study the complexity of β-reduction for redexes of order 2,3 and 4. The obtained results are: evaluation of boolean expressions can be reduced to β-reduction of order 2 and β-reduction of order 2 is in O(nlog n), β-reduction of order 3 is complete for PTIME, and β-reduction of order 4 is complete for PSPACE. 1
