Sciweavers

8298 search results - page 96 / 1660
» On the Complexity of Numerical Analysis
Sort
View
CADE
2008
Springer
15 years 8 months ago
Automated Implicit Computational Complexity Analysis (System Description)
Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully autom...
Martin Avanzini, Georg Moser, Andreas Schnabl
AAAI
1998
15 years 7 months ago
Complexity Analysis of Admissible Heuristic Search
Richard E. Korf, Michael Reid