Corpus ID: 18723447

Going for Speed: Sublinear Algorithms for Dense r-CSPs

@article{Yaroslavtsev2014GoingFS,
  title={Going for Speed: Sublinear Algorithms for Dense r-CSPs},
  author={Grigory Yaroslavtsev},
  journal={ArXiv},
  year={2014},
  volume={abs/1407.7887}
}
  • Grigory Yaroslavtsev
  • Published 2014
  • Computer Science, Mathematics
  • ArXiv
  • We give new sublinear and parallel algorithms for the extensively studied problem of approximating n-variable r-CSPs (constraint satisfaction problems with constraints of arity r up to an additive error. The running time of our algorithms is O(n/\epsilon^2) + 2^O(1/\epsilon^2) for Boolean r-CSPs and O(k^4 n / \epsilon^2) + 2^O(log k / \epsilon^2) for r-CSPs with constraints on variables over an alphabet of size k. For any constant k this gives optimal dependence on n in the running time… CONTINUE READING

    Citations

    Publications citing this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 26 REFERENCES