Definable Inapproximability: New Challenges for Duplicator (Q5079727)

From MaRDI portal
scientific article; zbMATH DE number 7533332
Language Label Description Also known as
English
Definable Inapproximability: New Challenges for Duplicator
scientific article; zbMATH DE number 7533332

    Statements

    0 references
    0 references
    28 May 2022
    0 references
    descriptive compleixty
    0 references
    hardness of approximation
    0 references
    max SAT
    0 references
    vertex cover
    0 references
    fixed-point logic with counting
    0 references
    Definable Inapproximability: New Challenges for Duplicator (English)
    0 references

    Identifiers