On the complexity of random satisfiability problems with planted solutions (extended abstract) (Q2941491)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of random satisfiability problems with planted solutions (extended abstract) |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of random satisfiability problems with planted solutions (extended abstract) |
scientific article |
Statements
On the Complexity of Random Satisfiability Problems with Planted Solutions (English)
0 references
21 August 2015
0 references
hypergraph partitioning
0 references
\(k\)-SAT
0 references
planted satisfiability
0 references
refutation
0 references
statistical algorithms
0 references
0 references
0.98967307806015
0 references
0.8013070225715637
0 references
0.7953459620475769
0 references
0.781923234462738
0 references
0.7806869149208069
0 references
