Solving sparse instances of Max SAT via width reduction and greedy restriction (Q905695)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Solving sparse instances of Max SAT via width reduction and greedy restriction
scientific article

    Statements

    Solving sparse instances of Max SAT via width reduction and greedy restriction (English)
    0 references
    0 references
    0 references
    0 references
    28 January 2016
    0 references
    0 references
    exponential time algorithm
    0 references
    polynomial space
    0 references
    weight
    0 references
    hard constraint
    0 references
    counting
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references