20 citations · 164 across the 63 of their papers we have counts for
Showing 2011 · cs.CCShow all
3 papers · 2 filters
cs.CC2011★ 6 cited
An additive combinatorics approach to the log-rank conjecture in communication complexity
Eli Ben-Sasson, Shachar Lovett, Noga Zewi
For a -valued matrix let denote the deterministic communication complexity of the boolean function associated with . The log-rank conjecture of Lovász…
cs.CC2011★ 2 cited
On the Furthest Hyperplane Problem and Maximal Margin Clustering
Zohar Karnin, Edo Liberty, Shachar Lovett +2
This paper introduces the Furthest Hyperplane Problem (FHP), which is an unsupervised counterpart of Support Vector Machines. Given a set of n points in Rd, the objective is to pro…
cs.CC2011
Correlation Testing for Affine Invariant Properties on in the High Error Regime
Hamed Hatami, Shachar Lovett
Recently there has been much interest in Gowers uniformity norms from the perspective of theoretical computer science. This is mainly due to the fact that these norms provide a met…