bn:03347322n
Noun Named Entity
Categories: Probabilistic complexity classes
EN
ZPP  zero-error probabilistic polynomial time  Zero error probability in polynomial time
EN
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. Wikipedia
English:
complexity
Definitions
Relations
Sources
EN
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. Wikipedia
Complexity class Wikidata