Abstract
We provide a characterization of fan annihilation rules of Lamping's optimal algorithm through suitable paths on the initial graphs of the evaluation. This allows to recast the computational complexity issues of the algorithm in terms of statics. The fruitfulness of the path characterization is pointed out by proving the relationship between the computational complexity of the Krivine machine and Lamping's algorithm.
Cite
CITATION STYLE
Asperti, A., & Laneve, C. (1997). On the dynamics of sharing graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1256, pp. 259–269). Springer Verlag. https://doi.org/10.1007/3-540-63165-8_183
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
