79
Voted
ECCC
2010
14 years 10 months ago
2010
89
Voted
ECCC
2010
14 years 10 months ago
2010
The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Kraj
102
click to vote
ECCC
2010
14 years 10 months ago
2010
Locally testable codes, i.e., codes where membership in the code is testable with a constant number of queries, have played a central role in complexity theory. It is well known t...
99
Voted
ECCC
2010
14 years 10 months ago
2010
We consider the randomized decision tree complexity of the recursive 3-majority function. For evaluating a height h formulae, we prove a lower bound for the -two-sided-error rando...
119
Voted
ECCC
2010
14 years 10 months ago
2010
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
ECCC
2010
14 years 10 months ago
2010
104
Voted
ECCC
2010
14 years 10 months ago
2010
We investigate the number of samples required for testing the monotonicity of a distribution with respect to an arbitrary underlying partially ordered set. Our first result is a n...
ECCC
2010
14 years 10 months ago
2010
ECCC
2010
14 years 10 months ago
2010
In previous works, Juba and Sudan [6] and Goldreich, Juba and Sudan [4] considered the idea of "semantic communication", wherein two players, a user and a server, attemp...
118
click to vote
ECCC
2010
14 years 11 months ago
2010
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...