Robust algorithms with polynomial loss for near-unanimity CSPs

Research output: Contribution to journal › Article › peer-review

Access to Document

Robust algorithms with polynomial loss for near-unanimity CSPs
Dalmau, V., Kozik, M., Krokhin, A., Makarychev, K., Makarychev, Y. & Opršal, J., 4 Jan 2017, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms. Klein, P. N. (ed.). Society for Industrial and Applied Mathematics (SIAM)
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

@article{42b47ed04c204e1f8c92aefb0648722d,

title = "Robust algorithms with polynomial loss for near-unanimity CSPs",

author = "V. Dalmau and M. Kozik and A. Krokhin and K. Makarychev and Y. Makarychev and J. Opr{\v s}al",

year = "2019",

month = jan,

doi = "10.1137/18M1163932",

language = "English",

volume = "48",

pages = "1763 -- 1795",

journal = "SIAM Journal on Computing",

issn = "0097-5397",

publisher = "Society for Industrial and Applied Mathematics",

number = "6",

}

TY - JOUR

T1 - Robust algorithms with polynomial loss for near-unanimity CSPs

AU - Dalmau, V.

AU - Kozik, M.

AU - Krokhin, A.

AU - Makarychev, K.

AU - Makarychev, Y.

AU - Opršal, J.

PY - 2019/1

Y1 - 2019/1

UR - https://www.scopus.com/pages/publications/85076926694

U2 - 10.1137/18M1163932

DO - 10.1137/18M1163932

M3 - Article

SN - 0097-5397

VL - 48

SP - 1763

EP - 1795

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

IS - 6

ER -