1. ZPP (complexity)In complexity theory, ZPP is the complexity class of problems for which a probabilistic Turing machine exists with these properties: It always returns the correct YES or NO answer. The running time is polynomial in expectation for every input. In other words, the algorithm is allowed to flip a truly-random coin while it is running. It always returns the correct answer. (Such an algorithm is called a Las Vegas algorithm.
Read “ZPP (complexity)” on English Wikipedia
Read “ZPP” on Japanese Wikipedia
Read “ZPP (complexity)” on DBpedia
Read “ZPP (complexity)” on English Wikipedia
Read “ZPP” on Japanese Wikipedia
Read “ZPP (complexity)” on DBpedia
Discussions
Log in to talk about this word.