|
|
|
|
| LEADER |
02801nmm a2200301 u 4500 |
| 001 |
EB000631532 |
| 003 |
EBX01000000000000001348774 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9781475735444
|
| 100 |
1 |
|
|a Homer, Steven
|
| 245 |
0 |
0 |
|a Computability and Complexity Theory
|h Elektronische Ressource
|c by Steven Homer, Alan L. Selman
|
| 250 |
|
|
|a 1st ed. 2001
|
| 260 |
|
|
|a New York, NY
|b Springer New York
|c 2001, 2001
|
| 300 |
|
|
|a XIII, 195 p
|b online resource
|
| 505 |
0 |
|
|a 1 Preliminaries -- 2 Introduction to Computability -- 3 Undecidability -- 4 Introduction to Complexity Theory -- 5 Basic Results of Complexity Theory -- 6 Nondeterminism and NP-Completeness -- 7 Relative Computability -- References -- Author Index
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Theory of Computation
|
| 700 |
1 |
|
|a Selman, Alan L.
|e [author]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Texts in Computer Science
|
| 028 |
5 |
0 |
|a 10.1007/978-1-4757-3544-4
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-1-4757-3544-4?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 004.0151
|
| 520 |
|
|
|a The theory of computing provides computer science with concepts, models, and formalisms for reasoning about both the resources needed to carry out computa tions and the efficiency of the computations that use these resources. lt provides tools to measure the difficulty of combinatorial problems both absolutely and in comparison with other problems. Courses in this subject help students gain an alytic skills and enable them to recognize the limits of computation. For these reasons, a course in the theory of computing is usually required in the graduate computer science curriculum. The barder question to address is which topics such a course should cover. We believe that students should learn the fundamental models of computation, the limitations of computation, and the distinctions between feasible and intractable. In particular, the phenomena ofNP-completeness and NP-hardness have pervaded much of science and transformed computer science. One option is to survey a large nurober of theoretical subjects, typically focusing on automata and formal languages. However, these subjects are less important to theoretical computer sci ence, and to computer science as a whole, now than in the past. Many students have taken such a course as part of their undergraduate education. We chose not to take that route because computability and complexity theory are the subjects that we feel deeply about and that we believe are important for students to learn. Furthermore, a graduate course should be scholarly. lt is better to treat important topics thoroughly than to survey the field
|