268 search results - page 24 / 54 » Recursion Theoretic Operators for Function Complexity Classe... |
PODS
2010
ACM
15 years 2 months ago
2010
ACM
We investigate a higher-order query language that embeds operators of the positive relational algebra within the simply-typed λ-calculus. Our language allows one to succinctly de...
IGPL
2006
14 years 9 months ago
2006
Since 1996, some models of recursive functions over the real numbers have been analyzed by several researchers. It could be expected that they exhibit a computational power much g...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
— Decisions on sources with memory transmitted over independent channels can be taken by employing trellis calculations. In this paper, it is shown that for a certain class of fu...
MFCS
2004
Springer
15 years 3 months ago
2004
Springer
Given a fixed computable binary operation , we study the complexity of the following generation problem: The input consists of strings ½ Ò . The question is whether is in the c...
ICDT
2010
ACM
14 years 11 months ago
2010
ACM
When a query is evaluated under bag semantics, each answer is returned as many times as it has derivations. Bag semantics has long been recognized as important, especially when ag...