3sat
E1454281
UNEXPLORED
3sat is a public, advertising-free cultural television channel jointly operated by German, Austrian, and Swiss broadcasters, focusing on highbrow arts, culture, and educational programming.
All labels observed (1)
| Label | Occurrences |
|---|---|
| 3sat canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T20862458 — 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: 3sat Context triple: [ZDFmediathek, contentProvider, 3sat]
-
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.
SATL
SATL is the abbreviation for Satakunta Air Command, a unit of the Finnish Air Force responsible for air operations and training.
-
D.
k-SAT
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.
-
E.
Boolean satisfiability problem
The Boolean satisfiability problem (SAT) is the canonical NP-complete decision problem of determining whether there exists an assignment of truth values to variables that makes a given Boolean formula evaluate to true.
- 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: 3sat Target entity description: 3sat is a public, advertising-free cultural television channel jointly operated by German, Austrian, and Swiss broadcasters, focusing on highbrow arts, culture, and educational programming.
-
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.
SATL
SATL is the abbreviation for Satakunta Air Command, a unit of the Finnish Air Force responsible for air operations and training.
-
D.
k-SAT
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.
-
E.
Boolean satisfiability problem
The Boolean satisfiability problem (SAT) is the canonical NP-complete decision problem of determining whether there exists an assignment of truth values to variables that makes a given Boolean formula evaluate to true.
- F. None of above. chosen
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.