76 search results - page 11 / 16 » On Boolean Functions with Generalized Cryptographic Properti... |
TIT
2008
13 years 6 months ago
2008
We introduce a new state discrimination problem in which we are given additional information about the state after the measurement, or more generally, after a quantum memory bound ...
AI
1999
Springer
13 years 7 months ago
1999
Springer
We present a new machine learning method that, given a set of training examples, induces a definition of the target concept in terms of a hierarchy of intermediate concepts and th...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of func...
FSE
2005
Springer
14 years 1 months ago
2005
Springer
T-functions were introduced by Klimov and Shamir in a series of papers during the last few years. They are of great interest for cryptography as they may provide some new building ...
IANDC
2007
13 years 7 months ago
2007
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...