3SAT
3SAT restricts the boolean formula to CNF with (at most) 3 literals per clause
Parameters
- : number of variables
Related Problems
- SAT2
Filters
Computational Model
Randomization
Approximation
Algorithms Table
Displaying 7 of 7 algorithms
| See more | ||||
|---|---|---|---|---|
| Jiang and Cai | 2026 | O(1.307031578^n) | O(n) | |
| Hertli (Modified PPSZ) | 2014 | O(1.307031594^n) | O(n) | |
| Schoning | 1999 | |||
| Paturi, Pudlák, Saks, Zane (PPSZ) 1998 | 1998 | O(1.36226^n) | ||
| Schiermeyer | 1996 | O(1.497^n) | O(n) | |
| Schiermeyer | 1993 | O(1.579^n) | ||
| Monien and Speckenmeyer | 1985 | O(1.6181^n) |
Reductions Table
Insuffient Data to display table
Other relevant algorithms
Insuffient Data to display table