On the complexity of random satisfiability problems with planted solutions (Q4577186)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6904512
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
17 July 2018
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.98967307806015
0 references
0.8142756819725037
0 references
0.798081636428833
0 references
0.7907981872558594
0 references
0.785184919834137
0 references
