Complexity of approximating CSP with balance / hard constraints (Q2988897)

From MaRDI portal
Revision as of 03:38, 26 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Complexity of approximating CSP with balance / hard constraints
scientific article

    Statements

    Complexity of approximating CSP with balance / hard constraints (English)
    0 references
    0 references
    0 references
    19 May 2017
    0 references
    0 references
    complexity dichotomy
    0 references
    constraint satisfaction problem
    0 references
    dictatorship testing
    0 references
    inapproximability
    0 references
    robust satisfiability
    0 references
    unique games conjecture
    0 references