Search Results for author:
Found 3 papers, 0 papers with code
Approximability of all Boolean CSPs with linear sketches
In this work we consider the approximability of $\textsf{Max-CSP}(f)$ in the context of sketching algorithms and completely characterize the approximability of all Boolean CSPs.
Computational Complexity Data Structures and Algorithms
On the computational complexity of the probabilistic label tree algorithms
First, we show that finding a tree with optimal training cost is NP-complete, nevertheless there are some tractable special cases with either perfect approximation or exact solution that can be obtained in linear time in terms of the number of labels $m$.
The information-theoretic value of unlabeled data in semi-supervised learning
Learning with the knowledge of the distribution (a. k. a.
