Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials

Bart M. P. Jansen, Astrid Pieterse. Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials. In Piotr Faliszewski, Anca Muscholl, Rolf Niedermeier, editors, 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland. Volume 58 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. [doi]

@inproceedings{JansenP16-0,
  title = {Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials},
  author = {Bart M. P. Jansen and Astrid Pieterse},
  year = {2016},
  doi = {10.4230/LIPIcs.MFCS.2016.71},
  url = {http://dx.doi.org/10.4230/LIPIcs.MFCS.2016.71},
  researchr = {https://researchr.org/publication/JansenP16-0},
  cites = {0},
  citedby = {0},
  booktitle = {41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016, August 22-26, 2016 - Kraków, Poland},
  editor = {Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier},
  volume = {58},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  isbn = {978-3-95977-016-3},
}