Robust algorithms with polynomial loss for near-unanimity CSPs

Summary

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Víctor Dalmau, Marcin Kozik, Andrei Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Opršal

Journal title: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms

Journal publisher: Society for Industrial and Applied Mathematics

Published year: 2017

Published pages: 340-357

DOI identifier: 10.1137/1.9781611974782.22

ISBN: 978-1-61197-478-2