10 search results - page 2 / 2 » eccc 2002 |
ECCC
2002
13 years 5 months ago
2002
We study the proper learnability of axis-parallel concept classes in the PAC-learning and exactlearning models. These classes include union of boxes, DNF, decision trees and multi...
ECCC
2002
13 years 5 months ago
2002
We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated...
ECCC
2002
13 years 5 months ago
2002
We say that a distribution over {0, 1}n is ( , k)-wise independent if its restriction to every k coordinates results in a distribution that is -close to the uniform distribution. ...
ECCC
2002
13 years 5 months ago
2002
We prove that if for some > 0, NP contains a set that is DTIME(2n )-bi-immune, then NP contains a set that is 2-Turing complete for NP (hence 3-truth-table complete) but not 1-t...
ECCC
2010
13 years 3 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...