On the complexity of finding and counting solution-free sets of integers (Q1752464)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the complexity of finding and counting solution-free sets of integers
scientific article

    Statements

    On the complexity of finding and counting solution-free sets of integers (English)
    0 references
    0 references
    0 references
    24 May 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    parameterised complexity
    0 references
    solution-free sets
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references