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

Sipser–Lautemann 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 Sipser–Lautemann theorem is a result in the field of computational complexity theory that addresses the relationship between complexity classes, particularly focusing on the class of languages recognized by nondeterministic polynomial time machines (NP) and certain probabilistic polynomial time machines (BPP).

 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