Sciweavers

16430 search results - page 652 / 3286
» On Computable Tree Functions
Sort
View
WOLLIC
2010
Springer
16 years 8 days ago
Feasible Functions over Co-inductive Data
Proof theoretic characterizations of complexity classes are of considerable interest because they link levels of conceptual abstraction to computational complexity. We consider he...
Ramyaa Ramyaa, Daniel Leivant
ENTCS
2007
112views more  ENTCS 2007»
15 years 7 months ago
Structure and Properties of Traces for Functional Programs
The tracer Hat records in a detailed trace the computation of a program written in the lazy functional language Haskell. The trace can then be viewed in various ways to support pr...
Olaf Chitil, Yong Luo
JCC
2007
63views more  JCC 2007»
15 years 7 months ago
Quantum correction to the pair distribution function
: We report a numerical technique that allows the quantum effects of zero-point motion to be incorporated into Pair Distribution Functions calculated classically for molecules usin...
V. A. Levashov, S. J. L. Billinge, M. F. Thorpe
AML
1999
86views more  AML 1999»
15 years 6 months ago
Subrecursive functions on partial sequences
The paper studies a domain theoretical notion of primitive recursion over partial sequences in the context of Scott domains. Based on a non-monotone coding of partial sequences, t...
Karl-Heinz Niggl
JCC
2002
73views more  JCC 2002»
15 years 6 months ago
Linear scaling approaches to quantum macromolecular similarity: Evaluating the similarity function
: The evaluation of the electron density based similarity function scales quadratically with respect to the size of the molecules for simplified, atomic shell densities. Due to the...
Pere Constans