Triple

T3308898
Position Surface form Disambiguated ID Type / Status
Subject Leslie Valiant E69521 entity
Predicate knownFor P22 FINISHED
Object Valiant–Vazirani theorem
The Valiant–Vazirani theorem is a fundamental result in computational complexity theory showing that solving unique solutions of NP problems is, under randomized reductions, as hard as solving general NP problems, with major implications for the study of randomness and hardness of approximation.
 E345812 NE FINISHED

Provenance (5 batches)

Stage Batch ID Job type Status
creating batch_69ad859f218081909458d2cebbf57565 elicitation completed
NER batch_69adb0e9f33c81909cff835a83e0a657 ner completed
NED1 batch_69b2f3edc0c081908a7f5c02fe18584b ned_source_triple completed
NED2 batch_69b303a4cb4481908b56ee60765b5fac ned_description completed
NEDg batch_69b2fa2ba81c8190bc86a855c59b7c2f nedg completed
Created at: March 8, 2026, 3:11 p.m.