ZPP |
|
|
In complexity theory, ZPP (Zero-error Probabilistic Polynomial time) is the set 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 unbounded, but is polynomial on average for any input.
GoldBamboo
This is an article about a computational complexity class. For Polish commu ...
Wikipedia - [full article]

Not Signed In -


