Robust Satisfiability for CSPs: Hardness and Algorithmic Results

Víctor Dalmau, Andrei A. Krokhin. Robust Satisfiability for CSPs: Hardness and Algorithmic Results. TOCT, 5(4):15, 2013. [doi]

@article{DalmauK13,
  title = {Robust Satisfiability for CSPs: Hardness and Algorithmic Results},
  author = {Víctor Dalmau and Andrei A. Krokhin},
  year = {2013},
  doi = {10.1145/2540090},
  url = {http://doi.acm.org/10.1145/2540090},
  researchr = {https://researchr.org/publication/DalmauK13},
  cites = {0},
  citedby = {0},
  journal = {TOCT},
  volume = {5},
  number = {4},
  pages = {15},
}