Introduction To Circuit Complexity: A Uniform Approach (Texts In Theoretical Computer Science. An Eatcs Series)

Introduction To Circuit Complexity: A Uniform Approach (Texts In Theoretical Computer Science. An Eatcs Series)

In Stock
SKU: DADAX3642083986
UPC: 9783642083983
Brand: Springer
Condition: New
Regular price$87.47
Quantity
Add to wishlist
Add to compare
Sold by Ergodebooks, an authorized reseller.

Processing time: 1-3 days

US Orders Ships in: 3-5 days

International Orders Ships in: 8-12 days

Return Policy: 15-days return on defective items

Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

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 are the dimensions of this book? A: The book measures six point one inches in length, zero point six seven inches in width, and nine point two five inches in height.
  • Q: How many pages are in this book? A: The book contains two hundred eighty-three pages, providing a comprehensive overview of its subject matter.
  • Q: What type of binding does this book have? A: This book is available in paperback binding, making it flexible and easy to handle.
  • Q: Who is the author of this book? A: The author of this book is Heribert Vollmer, a recognized figure in theoretical computer science.
  • Q: What is the main topic of this book? A: This book focuses on computational complexity theory of boolean circuits, offering an advanced perspective for readers.
  • Q: Is this book suitable for beginners? A: No, this book is intended for advanced readers familiar with theoretical computer science and mathematics.
  • Q: What is the target audience for this book? A: The target audience includes theoretical computer scientists and mathematicians seeking in-depth knowledge.
  • Q: Can I use this book for reference in my studies? A: Yes, this book serves as a valuable reference with extensive citations and modern insights into its field.
  • Q: What level of complexity can I expect from this book? A: Readers can expect an advanced level of complexity, making it ideal for those with prior knowledge in the subject.
  • Q: How should I care for this paperback book? A: To keep this paperback book in good condition, store it in a cool, dry place and avoid exposure to direct sunlight.
  • Q: Is this book safe for all age groups? A: Yes, there are no explicit adult themes, but it is recommended for mature readers due to its complex content.
  • Q: How should I store this book? A: Store this book upright on a shelf, ensuring it is not overstuffed to avoid bending the covers or pages.
  • Q: What should I do if the book arrives damaged? A: If the book arrives damaged, you should contact the seller for return instructions or a replacement.
  • Q: Is there a warranty for this book? A: Typically, books do not come with a warranty, but check with the seller for their return and exchange policy.
  • Q: Can I return this book if I am not satisfied? A: Yes, most sellers offer a return policy, but be sure to check the specific terms and conditions.
  • Q: What if I have questions about the content? A: If you have questions about the content, you may refer to the extensive references in the book or consult additional academic resources.

Recently Viewed