Triple
T7666072
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | NP-completeness |
E173625
|
entity |
| Predicate | hasCanonicalProblem |
P78665
|
FINISHED |
| Object |
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.
|
E679892
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69c699562484819086752091e3164a27 |
elicitation | completed |
| NER | batch_69c708affd048190bf21bcc1796a3c39 |
ner | completed |
| NED1 | batch_69c89b1fdccc8190a69b4745dc3b2347 |
ned_source_triple | completed |
| NED2 | batch_69c89ddd81a88190924d41529e94b06b |
ned_description | completed |
| NEDg | batch_69c89d513af88190b453bf3bf1adcbfb |
nedg | completed |
Created at: March 27, 2026, 4 p.m.