k-SAT
E1452090
UNEXPLORED
k-SAT is a canonical NP-complete decision problem in Boolean logic where one asks whether there exists a truth assignment satisfying a formula expressed as a conjunction of clauses, each containing at most k literals.
All labels observed (2)
| Label | Occurrences |
|---|---|
| k-SAT canonical | 2 |
| 2-SAT is solvable in polynomial time | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T20836568 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: k-SAT Context triple: [SAT problem, restriction, k-SAT]
-
A.
3-SAT
3-SAT is a classic Boolean satisfiability problem where each clause has exactly three literals and which serves as a fundamental NP-complete benchmark in computational complexity theory.
-
B.
Max-3-SAT
Max-3-SAT is an optimization variant of the Boolean satisfiability problem where the goal is to maximize the number of satisfied clauses, each containing exactly three literals, and it serves as a central problem in the study of approximation algorithms and hardness of approximation.
-
C.
Unique-SAT
Unique-SAT is a specialized version of the Boolean satisfiability problem where instances are guaranteed to have at most one satisfying assignment, and it plays a central role in complexity theory due to its connections to randomness and NP-completeness.
-
D.
Max-SAT
Max-SAT is the optimization variant of the Boolean satisfiability problem in which the goal is to find an assignment that satisfies the maximum possible number of clauses, making it a central problem in approximation algorithms and complexity theory.
-
E.
“Inapproximability results for SAT and other problems”
“Inapproximability results for SAT and other problems” is a seminal theoretical computer science paper by Johan Håstad that establishes tight hardness-of-approximation bounds for satisfiability and related optimization problems using probabilistically checkable proofs.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: k-SAT Target entity description: k-SAT is a canonical NP-complete decision problem in Boolean logic where one asks whether there exists a truth assignment satisfying a formula expressed as a conjunction of clauses, each containing at most k literals.
-
A.
3-SAT
3-SAT is a classic Boolean satisfiability problem where each clause has exactly three literals and which serves as a fundamental NP-complete benchmark in computational complexity theory.
-
B.
Max-3-SAT
Max-3-SAT is an optimization variant of the Boolean satisfiability problem where the goal is to maximize the number of satisfied clauses, each containing exactly three literals, and it serves as a central problem in the study of approximation algorithms and hardness of approximation.
-
C.
Unique-SAT
Unique-SAT is a specialized version of the Boolean satisfiability problem where instances are guaranteed to have at most one satisfying assignment, and it plays a central role in complexity theory due to its connections to randomness and NP-completeness.
-
D.
Max-SAT
Max-SAT is the optimization variant of the Boolean satisfiability problem in which the goal is to find an assignment that satisfies the maximum possible number of clauses, making it a central problem in approximation algorithms and complexity theory.
-
E.
“Inapproximability results for SAT and other problems”
“Inapproximability results for SAT and other problems” is a seminal theoretical computer science paper by Johan Håstad that establishes tight hardness-of-approximation bounds for satisfiability and related optimization problems using probabilistically checkable proofs.
- F. None of above. chosen
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: k-SAT