PPSZ for general \(k\)-SAT and CSP -- making Hertli's analysis simpler and 3-SAT faster (Q6655885)
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: PPSZ for general \(k\)-SAT and CSP -- making Hertli's analysis simpler and 3-SAT faster |
scientific article; zbMATH DE number 7960914
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | PPSZ for general \(k\)-SAT and CSP -- making Hertli's analysis simpler and 3-SAT faster |
scientific article; zbMATH DE number 7960914 |
Statements
PPSZ for general \(k\)-SAT and CSP -- making Hertli's analysis simpler and 3-SAT faster (English)
0 references
27 December 2024
0 references
Boolean satisfiability
0 references
exponential algorithms
0 references
randomized algorithms
0 references
