Computability and complexity

By:

Chen, Hubie

Publication details: MIT Press 2023 CambridgeDescription: vi, 394pISBN:

9780262048620

Subject(s):

Computational complexity

DDC classification:

511.352 C420c

Summary: 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

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Collection	Call number	Status	Date due	Barcode	Item holds
Reference	PK Kelkar Library, IIT Kanpur	In Acquisition	511.352 C420c (Browse shelf(Opens below))	Not for loan		A187033

Total holds: 0

Browsing PK Kelkar Library, IIT Kanpur shelves, Shelving location: Processing Center, Collection: In Acquisition Close shelf browser (Hides shelf browser)


	006.31 J78o Optimization algorithms for distributed machine learning	006.31 J954m Machine learning The basics	006.3223 Ex73e Explainable and interpretable reinforcement learning for robotics	511.352 C420c Computability and complexity	621.31244 B197p Photovoltaic (PV) system delivery as reliable energy infrastructure

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

There are no comments on this title.

to post a comment.

Print
Add to your cart (remove)
Save record
BIBTEX Dublin Core ISBD MARC (non-Unicode/MARC-8) RIS MARC (Unicode/UTF-8)
More searches

Search for this title in:
Other Libraries (WorldCat) Other Databases (Google Scholar) Online Stores (Bookfinder.com) Open Library (openlibrary.org)

Welcome to P K Kelkar Library, Online Public Access Catalogue (OPAC)

Computability and complexity

Browsing PK Kelkar Library, IIT Kanpur shelves, Shelving location: Processing Center, Collection: In Acquisition Close shelf browser (Hides shelf browser)