112
click to vote
CADE
2001
Springer
16 years 3 months ago
2001
Springer
Abstract. Nontrivial meta-complexity theorems, proved once for a programming language as a whole, facilitate the presentation and analysis of particular algorithms. This paper give...