| 书目名称 | Computability and Complexity |
| 副标题 | Foundations and Tool |
| 编辑 | Rod Downey |
| 视频video | |
| 概述 | Provides a uniquely concise introduction to these subjects.Includes numerous examples and exercises.Progresses from general to deeper models of computability |
| 丛书名称 | Undergraduate Topics in Computer Science |
| 图书封面 |  |
| 描述 | .This is a book about computation, something which is ubiquitous in the modern world. More precisely, it examines computability theory and computational complexity theory. Computability theory is the part of mathematics and computer science which seeks to clarify what we mean by computation or algorithm. When is there a computational solution possible to some question? How can we show that none is possible? How computationally hard is the question we are concerned with? Arguably, this area lead to the development of digital computers. (Computational) complexity theory is an intellectual heir of computability theory. Complexity theory is concerned with understanding what resources are needed for computation, where typically we would measure the resources in terms of time and space. Can we perform some task in a feasible number of steps? Can we perform some algorithm with only a limited memory? Does randomness help? Are there standard approaches to overcoming computational difficulty?. |
| 出版日期 | Textbook 2024 |
| 关键词 | Finite automata; NP-completeness; Parameterized complexity; Reducability; Recursion; Structural complexit |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-031-53744-8 |
| isbn_softcover | 978-3-031-53743-1 |
| isbn_ebook | 978-3-031-53744-8Series ISSN 1863-7310 Series E-ISSN 2197-1781 |
| issn_series | 1863-7310 |
| copyright | The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerl |
发表于 2025-3-21 16:46:27
