On the Complexity of Random Satisfiability Problems with Planted Solutions (Q4577186)

From MaRDI portal
scientific article; zbMATH DE number 6904512
Language Label Description Also known as
English
On the Complexity of Random Satisfiability Problems with Planted Solutions
scientific article; zbMATH DE number 6904512

    Statements

    On the Complexity of Random Satisfiability Problems with Planted Solutions (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 July 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    planted satisfiability
    0 references
    statistical algorithms
    0 references
    \(k\)-SAT
    0 references
    hypergraph partitioning
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references