Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs (2019)

First Author: Dalmau V
Attributed to:  Robustly Tractable Constraint Satisfaction Problems funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1137/18m1163932

Publication URI: http://dx.doi.org/10.1137/18m1163932

Type: Journal Article/Review

Parent Publication: SIAM Journal on Computing

Issue: 6