Sciweavers

179 search results - page 17 / 36
» eccc 2010
Sort
View
ECCC
2006
93views more  ECCC 2006»
13 years 7 months ago
On the Deduction Theorem and Complete Disjoint NP-Pairs
In this paper we ask the question whether the extended Frege proof system EF satisfies a weak version of the deduction theorem. We prove that if this is the case, then complete dis...
Olaf Beyersdorff
ECCC
2006
87views more  ECCC 2006»
13 years 7 months ago
The Learnability of Quantum States
Traditional quantum state tomography requires a number of measurements that grows exponentially with the number of qubits n. But using ideas from computational learning theory, we...
Scott Aaronson
ECCC
2006
97views more  ECCC 2006»
13 years 7 months ago
Cryptographic Hardness Results for Learning Intersections of Halfspaces
We give the first representation-independent hardness results for PAC learning intersections of halfspaces, a central concept class in computational learning theory. Our hardness ...
Adam R. Klivans, Alexander A. Sherstov
ECCC
2006
75views more  ECCC 2006»
13 years 7 months ago
Note on MAX 2SAT
In this note we present an approximation algorithm for MAX 2SAT that given a (1 - ) satisfiable instance finds an assignment of variables satisfying a 1 - O( ) fraction of all co...
Moses Charikar, Konstantin Makarychev, Yury Makary...
ECCC
2007
77views more  ECCC 2007»
13 years 7 months ago
Selected Results in Additive Combinatorics: An Exposition
We give a self-contained exposition of selected results in additive combinatorics over the group GF(2)n = {0, 1}n. In particular, we prove the celebrated theorems known as the Bal...
Emanuele Viola