• Bookmarks

    Bookmarks

  • Concepts

    Concepts

  • Activity

    Activity

  • Courses

    Courses


ZPP (Zero-error Probabilistic Polynomial time) is a complexity class representing decision problems that can be solved by a probabilistic Turing machine in polynomial time with zero error probability. It combines the characteristics of both RP (Randomized Polynomial time) and co-RP, ensuring that the algorithm either provides the correct answer or returns 'I don't know' with equal probability for both outcomes in polynomial time.
History Empty State Icon

Log in to see lessons

3