Solving non-uniform planted and filtered random SAT formulas greedily (Q2118298)
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: Solving non-uniform planted and filtered random SAT formulas greedily |
scientific article; zbMATH DE number 7495573
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving non-uniform planted and filtered random SAT formulas greedily |
scientific article; zbMATH DE number 7495573 |
Statements
Solving non-uniform planted and filtered random SAT formulas greedily (English)
0 references
22 March 2022
0 references
random \(k\)-SAT
0 references
planted \(k\)-SAT
0 references
non-uniform variable distribution
0 references
greedy algorithm
0 references
local search
0 references
0 references
0 references
