3-SAT
Special case of the Boolean satisfiablility problem in conjunctive normal form where each clause has ≤3 literals
Nº Q339688 ★
Common · Knowledge
3-SAT
Special case of the Boolean satisfiablility problem in conjunctive normal form where each clause has ≤3 literals
Text: Wikipédia, CC BY-SA 4.0. · Image: Thore Husfeldt (talk) (CC BY-SA 3.0) ·
Related cards
-
P versus NP problem
Unsolved problem in computer science about time complexity
Nº Q746242 ★★★★
Not listed
-
Knapsack problem
Problem in combinatorial optimization
Nº Q864457 ★★★
Not listed
-
Block-stacking problem
Mathematical problem
Nº Q16843263 ★
Not listed
-
C
Computational complexity
Measure of the amount of resources needed to run an algorithm or solve a computational problem
Nº Q5157286 ★★★
Not listed
-
L (complexity)
Complexity class (logarithmic space)
Nº Q1192782 ★★
Not listed
-
A
Answer set programming
Programming paradigm focused on difficult search problems
Nº Q2852531 ★
Not listed