A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
A universal tree balancing theorem
[article]
2017
arXiv
pre-print
We present a general framework for balancing expressions (terms) in form of so called tree straight-line programs. The latter can be seen as circuits over the free term algebra extended by contexts (terms with a hole) and the operations which insert terms/contexts into contexts. It is shown that for every term one can compute in DLOGTIME-uniform TC^0 a tree straight-line program of logarithmic depth and size O(n/ n). This allows reducing the term evaluation problem over an arbitrary algebra A
arXiv:1704.08705v3
fatcat:ww45wpahx5axvd2wkxvfwqppci