ACM Symposium on Discrete Algorithms, SODA 2017


Article Details
Title: Robust algorithms with polynomial loss for near-unanimity CSPs
Article URLs:
Alternative Article URLs:
Authors: Víctor Dalmau
  • University Pompeu Fabra
Marcin Kozik
  • Jagiellonian University, Kraków
Andrei A. Krokhin
  • Durham University
Konstantin Makarychev
  • Microsoft Research
Yury Makarychev
  • Toyota Technological Institute at Chicago
Jakub Oprsal
  • Jagiellonian University, Kraków
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1150062, 1302662
DBLP Key: conf/soda/DalmauKKMMO17
Author Comments:

Discuss this paper and its artifacts below