Introduction to Circuit Complexity
An advanced textbook giving a broad, modern view of the computational complexity theory of boolean circuits, with extensive references, for theoretical computer scientists and mathematicians.4.5. Summary of reductions. An arrow from A to B means that A is reducible to B. We add references for problems not studied in the text of this chapter. The class DET, which is mentioned in the figure, is defined and examined in Exercise 4.15.
| Title | : | Introduction to Circuit Complexity |
| Author | : | Heribert Vollmer |
| Publisher | : | Springer Science & Business Media - 1999-06-23 |
You must register with us as either a Registered User before you can Download this Book. You'll be greeted by a simple sign-up page.
Once you have finished the sign-up process, you will be redirected to your download Book page.
How it works:- 1. Register a free 1 month Trial Account.
- 2. Download as many books as you like (Personal use)
- 3. Cancel the membership at any time if not satisfied.
