ECCC
2010
13 years 10 months ago
2010
Parameterized Resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [16] (FOCS’07). In that paper, Dan...
ECCC
2010
13 years 10 months ago
2010
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...
ECCC
2010
13 years 10 months ago
2010
ECCC
2010
13 years 10 months ago
2010
ECCC
2010
13 years 10 months ago
2010
In this paper we study polynomial identity testing of sums of k read-once algebraic branching programs (Σk-RO-ABPs), generalizing the work of Shpilka and Volkovich [1, 2], who co...
ECCC
2010
13 years 10 months ago
2010
Applications based on outsourcing computation require guarantees to the data owner that the desired computation has been performed correctly by the service provider. Methods based...
ECCC
2010
13 years 10 months ago
2010
In this paper we study the degree of non-constant symmetric functions f : {0, 1}n → {0, 1, . . . , c}, where c ∈ N, when represented as polynomials over the real numbers. We s...
ECCC
2010
13 years 10 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
2010
13 years 10 months ago
2010
We initiate the study of the proof complexity of propositional encoding of (weak cases of) concrete independence results. In particular we study the proof complexity of Paris-Harr...
ECCC
2010
13 years 10 months ago
2010
We show that it is possible to encode any communication protocol between two parties so that the protocol succeeds even if a (1/4 − ǫ) fraction of all symbols transmitted by th...