Computational Complexity

Computational Complexity

SKU: SONG0201530821 Out of Stock
Sale price$41.81 Regular price$46.00
Sold out Save $4.19
Quantity
Add to wishlist
Add to compare
Shipping & Tax will be calculated at Checkout.
Delivery time: 3-5 business days (USA)
Delivery time: 8-12 business days (International)
15 days return policy
Payment Options

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

Customer Reviews

Be the first to write a review
0%
(0)
0%
(0)
0%
(0)
0%
(0)
0%
(0)

This Text Offers A Comprehensive And Accessible Treatment Of The Theory Of Algorithms And Complexity The Elegant Body Of Concepts And Methods Developed By Computer Scientists Over The Past 30 Years For Studying The Performance And Limitations Of Computer Algorithms. Among Topics Covered Are: Reductions And Npcompleteness, Cryptography And Protocols, Randomized Algorithms, And Approximability Of Optimization Problems, Circuit Complexity, The Structural Aspects Of The P=Np Question, Parallel Computation, The Polynomial Hierarchy, And Many Others. Several Sophisticated And Recent Results Are Presented In A Rather Simple Way, While Many More Are Developed In The Form Of Extensive Notes, Problems, And Hints. The Book Is Surprisingly Selfcontained, In That It Develops All Necessary Mathematical Prerequisites From Such Diverse Fields As Computability, Logic, Number Theory, Combinatorics And Probability.

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 topics are covered in 'Computational Complexity'? A: 'Computational Complexity' covers a wide range of topics including reductions and NP-completeness, cryptography and protocols, randomized algorithms, approximability of optimization problems, circuit complexity, the P=NP question, parallel computation, and the polynomial hierarchy.
  • Q: Who is the author of 'Computational Complexity'? A: The book is authored by Christos Papadimitriou, a well-respected figure in the field of computer science.
  • Q: What is the publication date of 'Computational Complexity'? A: 'Computational Complexity' was published on November 30, 1993.
  • Q: How many pages does 'Computational Complexity' have? A: The book contains a total of 523 pages.
  • Q: What is the binding type of 'Computational Complexity'? A: 'Computational Complexity' is available in a paperback binding.
  • Q: Is 'Computational Complexity' suitable for beginners in computer science? A: Yes, the text offers a comprehensive and accessible treatment of the concepts, making it suitable for both beginners and those with more advanced knowledge.
  • Q: Does 'Computational Complexity' include exercises or problems? A: Yes, the book includes extensive notes, problems, and hints to help reinforce the material presented.
  • Q: What are the prerequisites for understanding 'Computational Complexity'? A: The book develops necessary mathematical prerequisites from fields such as computability, logic, number theory, combinatorics, and probability.
  • Q: Is this book a self-contained resource? A: Yes, 'Computational Complexity' is designed to be self-contained, covering all necessary topics and prerequisites.
  • Q: What edition of 'Computational Complexity' is available? A: The book is available in its first edition.