COCO
2007
Springer
13 years 8 months ago
2007
Springer
We prove new results on the circuit complexity of Approximate Majority, which is the problem of computing Majority of a given bit string whose fraction of 1's is bounded away...
COCO
2007
Springer
13 years 8 months ago
2007
Springer
COCO
2007
Springer
13 years 8 months ago
2007
Springer
COCO
2007
Springer
13 years 8 months ago
2007
Springer
Current constructions of efficient argument systems combine a short (polynomial size) PCP with a cryptographic hashing technique. We suggest an alternative approach for this probl...
COCO
2007
Springer
13 years 10 months ago
2007
Springer
Antunes, Fortnow, van Melkebeek and Vinodchandran captured the notion of non-random information by computational depth, the difference between the polynomialtime-bounded Kolmogoro...
COCO
2007
Springer
13 years 10 months ago
2007
Springer
There exists a positive constant α < 1 such that for any function T(n) ≤ nα and for any problem L ∈ BPTIME(T(n)), there exists a deterministic algorithm running in poly(T...
COCO
2007
Springer
13 years 10 months ago
2007
Springer
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...
COCO
2007
Springer
13 years 10 months ago
2007
Springer
A halfspace matrix is a Boolean matrix A with rows indexed by linear threshold functions f, columns indexed by inputs x ∈ {−1,1}n, and the entries given by Af,x = f(x). We dem...
COCO
2007
Springer
13 years 10 months ago
2007
Springer
We study semidefinite programming relaxations of Vertex Cover arising from repeated applications of the LS+ “lift-and-project” method of Lovasz and Schrijver starting from th...
COCO
2007
Springer
13 years 10 months ago
2007
Springer
We study the link between the complexity of a polynomial and that of its coefficient functions. Valiant’s theory is a good setting for this, and we start by generalizing one of V...