Title
Introduction to Circuit Complexity: A Uniform Approach (Texts in Theoretical Computer Science. An EATCS Series),Used
Delivery time: 8-12 business days (International)
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.
By changing our most important processes and
products, we have already made a big leap forward. This ranges from the
increased use of more sustainable fibers to the use of more
environmentally friendly printing processes to the development of
efficient waste management in our value chain.
⚠️ 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.
Shipping & Returns
Shipping
We ship your order within 2–3 business days for USA deliveries and 5–8 business days for international shipments. Once your package has been dispatched from our warehouse, you'll receive an email confirmation with a tracking number, allowing you to track the status of your delivery.
Returns
To facilitate a smooth return process, a Return Authorization (RA) Number is required for all returns. Returns without a valid RA number will be declined and may incur additional fees. You can request an RA number within 15 days of the original delivery date. For more details, please refer to our Return & Refund Policy page.
Shipping & Returns
Shipping
We ship your order within 2–3 business days for USA deliveries and 5–8 business days for international shipments. Once your package has been dispatched from our warehouse, you'll receive an email confirmation with a tracking number, allowing you to track the status of your delivery.
Returns
To facilitate a smooth return process, a Return Authorization (RA) Number is required for all returns. Returns without a valid RA number will be declined and may incur additional fees. You can request an RA number within 15 days of the original delivery date. For more details, please refer to our Return & Refund Policy page.
Warranty
We provide a 2-year limited warranty, from the date of purchase for all our products.
If you believe you have received a defective product, or are experiencing any problems with your product, please contact us.
This warranty strictly does not cover damages that arose from negligence, misuse, wear and tear, or not in accordance with product instructions (dropping the product, etc.).
Warranty
We provide a 2-year limited warranty, from the date of purchase for all our products.
If you believe you have received a defective product, or are experiencing any problems with your product, please contact us.
This warranty strictly does not cover damages that arose from negligence, misuse, wear and tear, or not in accordance with product instructions (dropping the product, etc.).
Secure Payment
Your payment information is processed securely. We do not store credit card details nor have access to your credit card information.
We accept payments with :
Visa, MasterCard, American Express, Paypal, Shopify Payments, Shop Pay and more.
Secure Payment
Your payment information is processed securely. We do not store credit card details nor have access to your credit card information.
We accept payments with :
Visa, MasterCard, American Express, Paypal, Shopify Payments, Shop Pay and more.
Related Products
You may also like
Frequently Asked Questions
- 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.