Sciweavers

45 search results - page 8 / 9
» The Intersection Theorem for Direct Products
Sort
View
COCO
2008
Springer
86views Algorithms» more  COCO 2008»
13 years 7 months ago
The Multiplicative Quantum Adversary
We present a new variant of the quantum adversary method. All adversary methods give lower bounds on the quantum query complexity of a function by bounding the change of a progres...
Robert Spalek
LOGCOM
2010
158views more  LOGCOM 2010»
13 years 4 months ago
Applying Universal Algebra to Lambda Calculus
The aim of this paper is double. From one side we survey the knowledge we have acquired these last ten years about the lattice of all λ-theories (= equational extensions of untype...
Giulio Manzonetto, Antonino Salibra
CRYPTO
2007
Springer
106views Cryptology» more  CRYPTO 2007»
13 years 9 months ago
Indistinguishability Amplification
system is the abstraction of the input-output behavior of any kind of discrete system, in particular cryptographic systems. Many aspects of cryptographic security analyses and pro...
Ueli M. Maurer, Krzysztof Pietrzak, Renato Renner
CORR
2006
Springer
120views Education» more  CORR 2006»
13 years 5 months ago
On the Role of Shared Entanglement
Despite the apparent similarity between shared randomness and shared entanglement in the context of Communication Complexity, our understanding of the latter is not as good as of ...
Dmitry Gavinsky
COCO
2004
Springer
185views Algorithms» more  COCO 2004»
13 years 9 months ago
Limitations of Quantum Advice and One-Way Communication
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...
Scott Aaronson