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

From MaRDI portal
scientific article; zbMATH DE number 7141256
Language Label Description Also known as
English
Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs
scientific article; zbMATH DE number 7141256

    Statements

    Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    9 December 2019
    0 references
    constraint satisfaction
    0 references
    approximation algorithms
    0 references
    robust algorithm
    0 references
    near-unanimity polymorphism
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references