The Valiant–Vazirani theorem is a result in theoretical computer science concerning the complexity of certain problems in the context of randomized algorithms. Specifically, it relates to the complexity class NP (nondeterministic polynomial time) and the concept of zero-knowledge proofs.
Articles by others on the same topic
There are currently no matching articles.