Triple
T5642217
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Inapproximability results for SAT and other problems |
E124291
|
entity |
| Predicate | relatedConcept |
P37
|
FINISHED |
| Object |
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.
|
E537214
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69c00824643c81909ffdb888a2d35189 |
elicitation | completed |
| NER | batch_69c022a6a22881908d16f4df564ed2a2 |
ner | completed |
| NED1 | batch_69c04d7c98008190b79528596eca4208 |
ned_source_triple | completed |
| NED2 | batch_69c04f7e64c88190bbced2f2460c1913 |
ned_description | completed |
| NEDg | batch_69c04edbf1f081908d74d0ac29601a35 |
nedg | completed |
Created at: March 22, 2026, 3:41 p.m.