OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Valiant–Vazirani theorem

 Home Mathematics Fields of mathematics Discrete mathematics Theorems in discrete mathematics Theorems in computational complexity theory
 0 By others on same topic  0 Discussions  1970-01-01  See my version
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.

 Ancestors (6)

  1. Theorems in computational complexity theory
  2. Theorems in discrete mathematics
  3. Discrete mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook