Triple
T1134458
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Avi Wigderson |
E23105
|
entity |
| Predicate | hasResearchInterest |
P934
|
FINISHED |
| Object |
P versus NP problem
The P versus NP problem is a central unsolved question in theoretical computer science that asks whether every problem whose solution can be quickly verified by a computer can also be quickly solved by a computer.
|
E131016
|
NE FINISHED |
Provenance (5 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69a493ec75988190b63a11bafaec29b4 |
elicitation | completed |
| NER | batch_69a4bbfffaa48190b2534ff4da3544ce |
ner | completed |
| NED1 | batch_69ac59ac2ea881908b9559ff9d47077a |
ned_source_triple | completed |
| NED2 | batch_69ac5aa2ad188190b4c6a29e3c2c8d79 |
ned_description | completed |
| NEDg | batch_69ac5a38ebb0819091cb81e23770ae50 |
nedg | completed |
Created at: March 1, 2026, 7:44 p.m.