Robust algorithms with polynomial loss for near-unanimity CSPs
Tytuł:
Robust algorithms with polynomial loss for near-unanimity CSPs
Czasopismo:
PROCEEDINGS OF THE 28TH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS SODA'17
Rok:
2017
Strony:
340-357