Robust algorithms with polynomial loss for near-unanimity CSPs

Vctor Dalmau, Marcin Kozik, Andrei Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Opršal

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

Fingerprint

Dive into the research topics of 'Robust algorithms with polynomial loss for near-unanimity CSPs'. Together they form a unique fingerprint.

Keyphrases

Computer Science