Triple
T14721014
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Valiant–Vazirani theorem |
E345812
|
entity |
| Predicate | showsHardnessOf |
P115516
|
FINISHED |
| Object |
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.
|
E1115574
|
NE FINISHED |
Provenance (7 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69d822e5911c8190ba589f957dbd9ba7 |
elicitation | completed |
| NER | batch_69dec25d56fc8190871873ca55d49272 |
ner | completed |
| NED1 | batch_69fdf0957bb081908f1f382f3be8ec20 |
ned_source_triple | completed |
| NED2 | batch_69fdf4f2acbc8190b51ee456093a2813 |
ned_description | completed |
| NEDg | batch_69fdf440a03c8190886119ab3c8ab610 |
nedg | completed |
| PD | batch_69de657e174481909da0437556334a04 |
pd | completed |
| PDg | batch_69de716d3aac8190aaa6dc1f099b86e8 |
pdg | completed |
Created at: April 10, 2026, 1:29 a.m.