Skip to Main Content
Theory of Computational Complexity, 2nd Edition
book

Theory of Computational Complexity, 2nd Edition

by Ding-Zhu Du, Ker-I Ko
June 2014
Intermediate to advanced content levelIntermediate to advanced
512 pages
17h 55m
English
Wiley
Content preview from Theory of Computational Complexity, 2nd Edition

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
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Theory of Computation

Theory of Computation

George Tourlakis

Publisher Resources

ISBN: 9781118594971Purchase book