14 search results - page 1 / 3 » Separations of Non-monotonic Randomness Notions |
CCA
2009
Springer
13 years 11 months ago
2009
Springer
In the theory of algorithmic randomness, several notions of random sequence are defined via a game-theoretic approach, and the notions that received most attention are perhaps Mar...
COMPGEOM
1997
ACM
13 years 8 months ago
1997
ACM
Given a pair of nonidentical complex objects, de ning and determining how similar they are to each other is a nontrivial problem. In data mining applications, one frequently nee...
EUROCRYPT
2007
Springer
13 years 10 months ago
2007
Springer
We study conditional computational entropy: the amount of randomness a distribution appears to have to a computationally bounded observer who is given some correlated information....
ENTCS
2007
13 years 4 months ago
2007
As a first step toward a notion of quantum data structures, we introduce a typing system for reflecting entanglement and separability. This is presented in the context of classi...
PROVSEC
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. Oracle separation methods are used in cryptography to rule out blackbox reductions between cryptographic primitives. It is sufficient to find an oracle relative to whic...