Synopsis
This book is an introduction to theoretical computer science, covering topics such as formal languages, automata theory, computability theory, and complexity theory. It provides a comprehensive overview of the foundational concepts, including regular languages and finite automata, context-free languages and pushdown automata, Turing machines and computability, and time and space complexity classes. The book also covers important theorems and results, such as the Pumping Lemma, the Church-Turing thesis, Godel's Incompleteness Theorem, and NP-completeness. It is written in a clear and concise manner, making it accessible to students and researchers with a basic understanding of discrete mathematics and programming. This book serves as an essential guide for anyone interested in the fundamental concepts of theoretical computer science.
"synopsis" may belong to another edition of this title.
Search results for Computational Complexity Theory Fundamentals - HandBook
Stock Image
Computational Complexity Theory Fundamentals - HandBook
Print on DemandSeller: California Books, Miami, FL, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Print on Demand. Seller Inventory # I-9798394110139
Stock Image
Computational Complexity Theory Fundamentals - HandBook
Print on DemandSeller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # L0-9798394110139
Stock Image
Computational Complexity Theory Fundamentals - HandBook
Print on DemandSeller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # L0-9798394110139
Buy New
US$ 27.85
US$ 4.40 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available