16430 search results - page 376 / 3286 » On Computable Tree Functions |
169
click to vote
CADE
2008
Springer
15 years 8 months ago
2008
Springer
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...
122
click to vote
AAECC
2006
Springer
15 years 6 months ago
2006
Springer
We describe a complete algorithm to compute the hypergeometric solutions of linear recurrence relations with rational function coefficients. We use the notion of finite singularit...
147
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We survey algorithms for computing isogenies between elliptic curves defined over a field of characteristic either 0 or a large prime. We introduce a new algorithm that computes an...
153
click to vote
LOGCOM
2007
15 years 6 months ago
2007
Abstract. We describe a natural generalization of ordinary computation to a third-order setting and give a function calculus with nice properties and recursion-theoretic characteri...
176
click to vote
SAC
2002
ACM
15 years 5 months ago
2002
ACM
This article shows how a non-decimated wavelet packet transform (NWPT) can be used to model a response time series,