31 search results - page 6 / 7 » eccc 2008 |
ECCC
2008
13 years 4 months ago
2008
Given a function f : {0, 1}n {0, 1}, let M (f) denote the smallest distance between f and a monotone function on {0, 1}n . Let M (f) denote the fraction of hypercube edges where f...
ECCC
2008
13 years 5 months ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
ECCC
2008
13 years 5 months ago
2008
We continue the investigation of the task of meaningful communication among intelligent entities (players, agents) without any prior common language. Our generic thesis is that su...
ECCC
2010
13 years 3 months ago
2010
We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008), in the context of error correcting codes. The first problem we address is that of me...
ECCC
2011
13 years 7 days ago
2011
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...