O'Reilly logo

Theory of Computational Complexity, 2nd Edition by Ker-I Ko, Ding-Zhu Du

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Corollary 9.16

For any function f in #P, we may define a set c09-math-0687. Then, c09-math-0688. By Theorem 9.6, we know that for all functions f, f is #P-complete if and only if Af is complete for PP under the c09-math-0693-reducibility. Therefore, the class PP has many c09-math-0694-complete sets. In the following, we show that some of these sets are actually complete for PP under the stronger c09-math-0695-reducibility.

Theorem 9.17

Proof

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required