16430 search results - page 25 / 3286 » On Computable Tree Functions |
CCGRID
2009
IEEE
14 years 2 months ago
2009
IEEE
—Current implementations of real-time collaborative applications rely on a dedicated infrastructure to carry out all synchronizing and communication functions, and require all en...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
A Direct Sum Theorem holds in a model of computation, when for every problem solving some k input instances together is k times as expensive as solving one. We show that Direct Su...
AFRICACRYPT
2008
Springer
13 years 9 months ago
2008
Springer
Proof-of-work schemes are economic measures to deter denial-of-service attacks: service requesters compute moderately hard functions the results of which are easy to check by the ...
STACS
2005
Springer
14 years 1 months ago
2005
Springer
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We ...
PLILP
1993
Springer
13 years 11 months ago
1993
Springer
Many recent proposals for the integration of functional and logic programming use conditional term rewriting systems (CTRS) as programs and narrowing as goal solving mechanism. Thi...