Sciweavers

45 search results - page 9 / 9
» The Intersection Theorem for Direct Products
Sort
View
CORR
2002
Springer
166views Education» more  CORR 2002»
13 years 5 months ago
Quantum Time-Space Tradeoffs for Sorting
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...
Hartmut Klauck
SODA
2012
ACM
196views Algorithms» more  SODA 2012»
11 years 7 months ago
Polytope approximation and the Mahler volume
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
ECTEL
2007
Springer
13 years 11 months ago
Reflections on Digital Literacy
Parallel to the societal diffusion of digital technologies, the debate on their impacts and requirements has created terms like ICT literacy, digital literacy or digital competenc...
Harald Gapski
STOC
2006
ACM
149views Algorithms» more  STOC 2006»
14 years 5 months ago
Bounded-error quantum state identification and exponential separations in communication complexity
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald d...
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
14 years 5 months ago
New direct-product testers and 2-query PCPs
The "direct product code" of a function f gives its values on all k-tuples (f(x1), . . . , f(xk)). This basic construct underlies "hardness amplification" in c...
Russell Impagliazzo, Valentine Kabanets, Avi Wigde...