69 citations · 336 across the 41 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2015★ 4 cited
Complexity Theoretic Limitations on Learning Halfspaces
Amit Daniely
We study the problem of agnostically learning halfspaces which is defined by a fixed but unknown distribution on . We define $\mathrm{Er…
cs.CC2012★ 5 cited
On the practically interesting instances of MAXCUT
Yonatan Bilu, Amit Daniely, Nati Linial +1
The complexity of a computational problem is traditionally quantified based on the hardness of its worst case. This approach has many advantages and has led to a deep and beautiful…