Title
Introduction to Circuit Complexity: A Uniform Approach (Texts in Theoretical Computer Science. An EATCS Series),Used
Sold by Ergodebooks, an authorized reseller.
Returns accepted within 30 days | support@ergodebooks.com
Shipping Information
- Free Standard Shipping — United States only
- Processing Time: 1–3 business days
- Estimated Delivery: 3–5 business days after dispatch
- Double-boxed, fully insured & discreetly packaged
- Tracking number sent via email once dispatched
- Orders over $250 require signature upon delivery. Taxes calculated at checkout.
Returns & Refund
Returns accepted within 30 days of delivery.
Damaged or Defective Item
Free return shipping + replacement or full refund
Wrong Item Received
Free return shipping + replacement or full refund
Change of Mind
Return shipping at customer's expense · 25% restocking fee applies
Payment Option
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.
⚠️ WARNING (California Proposition 65):
This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.
For more information, please visit www.P65Warnings.ca.gov.
- Q: What is the main focus of the book 'Introduction to Circuit Complexity'? A: The book provides a broad and modern view of computational complexity theory specifically related to boolean circuits, making it ideal for theoretical computer scientists and mathematicians.
- Q: Who is the author of this textbook? A: The author of 'Introduction to Circuit Complexity' is Heribert Vollmer.
- Q: When was 'Introduction to Circuit Complexity' published? A: The book was published on December 8, 2010.
- Q: How many pages does this book contain? A: The textbook contains 283 pages.
- Q: What is the binding type of this book? A: This edition of the book is a paperback binding.
- Q: Is this book suitable for beginners in computational complexity? A: This book is an advanced textbook and may not be suitable for beginners; it is more appropriate for those with a solid understanding of theoretical computer science.
- Q: Does this book include references for further reading? A: Yes, the book includes extensive references, offering additional resources for readers interested in exploring the topic further.
- Q: What edition of the book is this? A: This is a softcover reprint of the hardcover first edition, originally published in 1999.
- Q: Is there a digital version of 'Introduction to Circuit Complexity' available? A: The product details do not specify a digital version; it's recommended to check with retailers for availability in e-book formats.
- Q: What topics are covered in 'Introduction to Circuit Complexity'? A: The book covers various aspects of computational complexity theory related to boolean circuits, but specific topics may vary and can be found in the book's table of contents.