0 ratings
Computational Complexity
A comprehensive and accessible treatment of the theory of algorithms and complexity
Computational Complexity
物品 #: 20128204

Computational Complexity

物品 #: 20128204

HKD 729

Price Details

Excluding Shipping & Custom charges ( Shipping and custom charges will be calculated on checkout )

*All items will import from 美國

0 ratings 轉寫評價
有存貨
美國 從USA商店導入

QTY:

現在訂購,約可在下列時間收貨: 星期五, 十月 23
Our Top Logistics Partners
  • fedex
  • dhl
A comprehensive and accessible treatment of the theory of algorithms and complexity
U-Care Warranty:
None
選擇一個計劃
fast shipping

Fast
Shipping

free return

Free
Return*

secure packaging

Secure Packaging

100% original products

100% Original Products

pci-dss

PCI DSS Compliance

iso certified

ISO 27001 Certified


paypal payment
visa payment
mastercard payment
Note: Step Down Voltage Transformer required for using electronics products of 美國 store (110-120). Recommended power converters 立即購買.

產品詳情

Explore the theory of algorithms and complexity at Ubuy 香港. Find the best deals on Computational Complexity 1st Edition. Shop now and enjoy worldwide shipping.
  • Comprehensive and accessible treatment of the theory of algorithms and complexity
  • Covers topics like reductions and NP-completeness, cryptography and protocols, randomized algorithms, and approximability of optimization problems
  • Provides a unified introduction to computational complexity integrating computation, applications, and logic
  • Includes an accessible introduction to logic, Boolean logic, first-order logic, and second-order logic
  • Presents extensive exercises with historical notes, references, and challenging problems
  • Develops all necessary mathematical prerequisites from diverse fields such as computability, logic, number theory, combinatorics, and probability
Publisher Pearson
Publication date November 30, 1993
Edition 1st
Language English
Print length 523 pages
ISBN-10 0201530821
ISBN-13 978-0201530827
Item Weight 1.85 pounds (840 grams)
Dimensions 1.1 x 6.1 x 8.9 inches (2.8 x 15.5 x 22.6 cm)
Country of OriginThis item will be imported from US
Date First AvailableApril 23, 2021
What is in the boxComputational Complexity... For more details, please check description/product details

產品敘述

Computational Complexity

About This Item

Introducing "Computational Complexity: 1st Edition" - the ultimate guide to understanding the theory of algorithms and complexity. This comprehensive and accessible textbook presents an elegant collection of concepts and methods developed by computer scientists over the past 30 years. Dive into the fascinating world of algorithm performance and limitations with this essential resource. This book covers a wide range of topics, including reductions and NP-completeness, cryptography and protocols, randomized algorithms, and approximability of optimization problems.

Delve into circuit complexity, the structural aspects of the P=NP question, parallel computation, the polynomial hierarchy, and many more intriguing subjects. What sets "Computational Complexity: 1st Edition" apart is its ability to present sophisticated and recent results in a simple and approachable manner. While some complex topics are explained concisely, others are explored through extensive notes, problems, and hints. The book also ensures that readers have all the necessary mathematical prerequisites, drawing from diverse fields such as computability, logic, number theory, combinatorics, and probability. Key features of "Computational Complexity: 1st Edition" include: 1.

Unified Introduction: This is the first book to provide a unified introduction to computational complexity. Gain a deep understanding of this field through its integration with computation, applications, and logic. 2. Accessible Logic: Boost your understanding of logic with the book's approachable introduction to Boolean logic, first-order logic, and second-order logic. 3.

Extensive Exercises: Reinforce your learning with the book's extensive exercises. Historical notes, references, and challenging problems accompany each chapter. Whether you're a student, researcher, or simply curious about computational complexity, this book is your go-to resource. Get your copy of "Computational Complexity: 1st Edition" and embark on a journey into the fascinating world of algorithms, complexity, and computation. Keywords: computational complexity book, 1st edition computational complexity, computational complexity textbook, computational complexity theory, computational complexity problems, introduction to computational complexity, complexity theory book, 1st edition book on computational complexity, advanced computational complexity, computational complexity and algorithms, computational complexity analysis, computational complexity classes, computational complexity algorithms, computational complexity examples, computational complexity research, computational complexity notes, computational complexity lectures.

有疑問? 與我們聊天

客戶問題與解答

  • 題: 如何從 Ubuy 在線購物 Computational Complexity?

    回答: 從 Ubuy 在線購物 Computational Complexity 非常簡單。. 您只需搜索產品,在結賬時選擇運輸方式,然後將其運送到您所在的位置。
  • 題: Computational Complexity 可以在 Hong Kong 在線購物嗎?

    回答: 是的,您可以在 Ubuy Hong Kong 以合理的價格購買該產品。. Computational Complexity 在本地不可用,但您可以信任我們的快遞服務。
  • 題: 下訂單後需要多長時間才能收到產品?

    回答: 您訂購的產品的交貨時間根據您訂購的商品和您選擇的運輸方式而有所不同。. 結賬時會提到預計送貨時間,所以購物時請放心。

Computer Science Editorial Review

Computational Complexity 1st Edition is a comprehensive book on complexity theory, specifically targeting a graduate school level audience. The content is well-explained and covers a wide range of topics in computational theory. It is recommended for those with a strong background in math and computer science theory, as the subject matter can be quite abstract and may require advanced reasoning skills to fully grasp. The book is Considered to be excellent by those within the field, and it is highly recommended for anyone interested in complexity theory. It is particularly useful for individuals who have already read Sipser's book and are looking for further exercises and knowledge in the field. While the book is a good introductory resource for students in computer science, it may not be as valuable for advanced researchers in theoretical computer science. Some reviewers felt that the content is shallow compared to Martin Davis's book, and that it does not include the latest results in the field. Additionally, it is worth noting that the book should be purchased at a reasonable price and should not be confused with a cheaper version under the same title. Overall, Computational Complexity 1st Edition is a well-presented book that covers the fundamentals of computational theory. It is suitable for self-study and provides a solid foundation for those interested in the field.

Customer Reviews & Ratings

5.0
1 客戶評分
  • 5 星
    100%
  • 4 星
    0%
  • 3 星
    0%
  • 2 星
    0%
  • 1 星
    0%

評價此產品

與其他客戶分享您的想法

優點

  • Comprehensive coverage of complexity theory
  • Well-explained concepts
  • Suitable for self-study

缺點

  • May be difficult to follow without strong training in math and computer science theory

Product Price History

重要資訊

  • 限制:如跨國購買產品,請注意製造商的保固有可能無效;製造商服務選項可能無法使用;產品手冊、教學、以及安全警示可能不會是目的地國家的語言;產品(與附加材料)設計也許不會符合目的地國家的標準、規格、以及標示要求;且產品也許不會符合目的地國家的伏特數值與其他電力標準(需要使用合適的變壓器或轉接器)。收件者須負責確定該產品在目的地國家可合法進口。當在 Ubuy 或其聯盟夥伴網站上訂購時,收件者為記錄上的進口者,且必須遵從目的地國家的法律與規範。
  • 由於 Ubuy 是一個全球搜尋引擎,並不是所有列於 Ubuy 的產品都有出售。產品須受出口/貿易法規規範。