96 search results - page 18 / 20 » On Several Proofs of the Recognizability Theorem |
104
click to vote
COCO
2004
Springer
15 years 1 months ago
2004
Springer
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
120
click to vote
CORR
2002
Springer
14 years 9 months ago
2002
Springer
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
IMA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We provide the first proof of security for Abreast-DM, one of the oldest and most wellknown constructions for turning a block cipher with n-bit block length and 2n-bit k...
ZUM
1991
Springer
15 years 1 months ago
1991
Springer
During 1990 and 1991 we carried out a survey of Z users in the UK; in this paper we present the results. Z is being used by a wide variety of companies for many different applicat...