Valiant–Vazirani theorem
E345812
UNEXPLORED
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.
Referenced by (1)
| Subject (surface form when different) | Predicate |
|---|---|
|
Leslie Valiant
→
|
knownFor |