Triple
T14721012
| Position | Surface form | Disambiguated ID | Type / Status |
|---|---|---|---|
| Subject | Valiant–Vazirani theorem |
E345812
|
entity |
| Predicate | statesRoughly |
P96496
|
FINISHED |
| Object | Solving SAT instances with a unique satisfying assignment is as hard as solving general SAT under randomized polynomial-time reductions |
—
|
LITERAL FINISHED |
Provenance (2 batches)
| Stage | Batch ID | Job type | Status |
|---|---|---|---|
| creating | batch_69d822e5911c8190ba589f957dbd9ba7 |
elicitation | completed |
| NER | batch_69dec25d56fc8190871873ca55d49272 |
ner | completed |
Created at: April 10, 2026, 1:29 a.m.