1717 search results - page 188 / 344 » A Computable Spectral Theorem |
132
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Although good encryption functions are probabilistic, most symbolic models do not capture this aspect explicitly. A typical solution, recently used to prove the soundness of such ...
280
click to vote
VSTTE
2012
Springer
14 years 1 months ago
2012
Springer
A piece of code in a computer program is infeasible if it cannot be part of any normally-terminating execution of the program. We develop an algorithm for the automatic detection o...
155
click to vote
TCC
2010
Springer
16 years 3 months ago
2010
Springer
We construct public-key cryptosystems that remain secure even when the adversary is given any computationally uninvertible function of the secret key as auxiliary input (even one t...
192
click to vote
FOSSACS
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. We lay the foundations of a first-order correspondence theory for coalgebraic logics that makes the transition structure explicit in the first-order modelling. In parti...
151
click to vote
COCO
2009
Springer
16 years 25 days ago
2009
Springer
We prove that poly-sized AC0 circuits cannot distinguish a poly-logarithmically independent distribution from the uniform one. This settles the 1990 conjecture by Linial and Nisan...