Computability and Complexity (Hardcover)
Chen, Hubie
- 出版商: Summit Valley Press
- 出版日期: 2023-08-29
- 售價: $2,370
- 貴賓價: 9.8 折 $2,323
- 語言: 英文
- 頁數: 416
- 裝訂: Hardcover - also called cloth, retail trade, or trade
- ISBN: 0262048620
- ISBN-13: 9780262048620
-
相關分類:
Computer-Science、Computer-networks
立即出貨 (庫存 < 3)
買這商品的人也買了...
-
$1,176Database Management Systems, 3/e (IE-Paperback)
-
$1,200$1,140 -
$2,470$2,347 -
$2,970Natural Language Processing with PyTorch
-
$1,750$1,715 -
$1,420$1,392 -
$2,600$2,470 -
$780$616 -
$1,188Learn LLVM 12 : A beginner's guide to learning LLVM compiler tools and core libraries with C++ (Paperback)
-
$520$390 -
$3,400$3,230 -
$1,800$1,710 -
$2,650$2,597 -
$2,625$2,573 -
$600$468 -
$780$663 -
$5,250$5,145 -
$2,150$2,107 -
$480$360 -
$1,400$1,330 -
$720$562 -
$2,780$2,641 -
$2,580$2,451 -
$650$514 -
$1,580$1,501
相關主題
商品描述
A clear, comprehensive, and rigorous introduction to the theory of computation.
What is computable? What leads to efficiency in computation? Computability and Complexity offers a clear, comprehensive, and rigorous introduction to the mathematical study of the capabilities and limitations of computation. Hubie Chen covers the core notions, techniques, methods, and questions of the theory of computation before turning to several advanced topics. Emphasizing intuitive learning and conceptual discussion, this textbook's accessible approach offers a robust foundation for understanding both the reach and restrictions of algorithms and computers.
- Extensive exercises and diagrams enhance streamlined, student-friendly presentation of mathematically rigorous material
- Includes thorough treatment of automata theory, computability theory, and complexity theory--including the P versus NP question and the theory of NP-completeness
- Suitable for undergraduate and graduate students, researchers, and professionals
作者簡介
Hubie Chen is an academic at King's College London. He has held invited positions at École polytechnique, Humboldt-Universität zu Berlin, and Universität Wien.