3690 search results - page 41 / 738 » Computation with classical sequents |
GC
2004
Springer
15 years 3 months ago
2004
Springer
Polynomial time adversaries based on a computational view of cryptography have additional capabilities that the classical Dolev-Yao adversary model does not include. To relate thes...
CCA
2009
Springer
15 years 4 months ago
2009
Springer
We define the computability of probability distributions on the real line as well as that of distribution functions. Mutual relationships between the computability notion of a pro...
103
click to vote
CIMCA
2008
IEEE
15 years 4 months ago
2008
IEEE
—The computational grid provides a promising platform for the deployment of various high-performance computing applications. In computational grid, an efficient scheduling of tas...
CIE
2005
Springer
15 years 3 months ago
2005
Springer
The strong weak truth table reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative randomness, alternative to the Solovay reducibility. It also occ...
ICDT
1997
ACM
15 years 1 months ago
1997
ACM
The paper introduces a model of the Web as an in nite, semistructured set of objects. We reconsider the classical notions of genericity and computability of queries in this new con...