Search Results for author:
Found 2 papers, 0 papers with code
Unambiguous DNFs and Alon-Saks-Seymour
We exhibit an unambiguous k-DNF formula that requires CNF width $\tilde{\Omega}(k^2)$, which is optimal up to logarithmic factors.
Computational Complexity
Data Stability in Clustering: A Closer Look
Awasthi et al. (2010) consider center-based objectives, and Balcan and Liang (2011) analyze the $k$-median and min-sum objectives, giving efficient algorithms for instances resilient to certain constant multiplicative perturbations.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
