Author:
Bonfante G.,Marion J.-Y.,Moyen J.-Y.
Subject
General Computer Science,Theoretical Computer Science
Reference38 articles.
1. Max-plus quasi-interpretations;Amadio,2003
2. A functional scenario for bytecode verification of resource bounds;Amadio,2004
3. Generalizing Cook’s transformation to imperative stack programs;Andersen,1994
4. On the combinatorial and algebraic complexity of quantifier elimination;Basu;Journal of the ACM,1996
5. A new recursion-theoretic characterization of the poly-time functions;Bellantoni;Computational Complexity,1992
Cited by
39 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献