85 search results - page 2 / 17 » A note on circuit lower bounds from derandomization |
STOC
2003
ACM
15 years 2 months ago
2003
ACM
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
ECCC
2010
14 years 9 months ago
2010
COLT
2006
Springer
15 years 1 months ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
101
click to vote
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...