Tensor decomposition and approximation schemes for constraint satisfaction problems

Wenceslas Fernandez de la Vega, Marek Karpinski, Ravi Kannan, Santosh Vempala. Tensor decomposition and approximation schemes for constraint satisfaction problems. In Harold N. Gabow, Ronald Fagin, editors, Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005. pages 747-754, ACM, 2005. [doi]

@inproceedings{VegaKKV05,
  title = {Tensor decomposition and approximation schemes for constraint satisfaction problems},
  author = {Wenceslas Fernandez de la Vega and Marek Karpinski and Ravi Kannan and Santosh Vempala},
  year = {2005},
  doi = {10.1145/1060590.1060701},
  url = {http://doi.acm.org/10.1145/1060590.1060701},
  tags = {constraints},
  researchr = {https://researchr.org/publication/VegaKKV05},
  cites = {0},
  citedby = {0},
  pages = {747-754},
  booktitle = {Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005},
  editor = {Harold N. Gabow and Ronald Fagin},
  publisher = {ACM},
  isbn = {1-58113-960-8},
}