|
|
|
|
| LEADER |
02434nmm a2200373 u 4500 |
| 001 |
EB000686969 |
| 003 |
EBX01000000000000000540051 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783662050804
|
| 100 |
1 |
|
|a Hemaspaandra, Lane A.
|
| 245 |
0 |
0 |
|a Theory of Semi-Feasible Algorithms
|h Elektronische Ressource
|c by Lane A. Hemaspaandra, Leen Torenvliet
|
| 250 |
|
|
|a 1st ed. 2003
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2003, 2003
|
| 300 |
|
|
|a X, 150 p
|b online resource
|
| 505 |
0 |
|
|a 1. Introduction to Semi-Feasible Computation -- 2. Advice -- 3. Lowness -- 4. Hardness for Complexity Classes -- 5. Closures -- 6. Generalizations and Related Notions -- A. Definitions of Reductions and Complexity Classes, and Notation List -- A.1 Reductions -- A.2 Complexity Classes -- A.3 Some Other Notation -- References
|
| 653 |
|
|
|a Programming Techniques
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Computer science / Mathematics
|
| 653 |
|
|
|a Computer programming
|
| 653 |
|
|
|a Discrete Mathematics in Computer Science
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Discrete Mathematics
|
| 653 |
|
|
|a Discrete mathematics
|
| 653 |
|
|
|a Theory of Computation
|
| 700 |
1 |
|
|a Torenvliet, Leen
|e [author]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Monographs in Theoretical Computer Science. An EATCS Series
|
| 028 |
5 |
0 |
|a 10.1007/978-3-662-05080-4
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-662-05080-4?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 005.11
|
| 520 |
|
|
|a This book presents a consolidated survey of the vibrant field of research known as the theory of semi-feasible algorithms. This research stream perfectly showcases the richness of, and contrasts between, the central notions of complexity: running time, nonuniform complexity, lowness, and NP-hardness. Research into semi-feasible computation has already developed a rich set of tools, yet is young enough to have an abundance of fresh, open issues. Being essentially self-contained, the book requires neither great mathematical maturity nor an extensive background in computational complexity theory or in computer science in general. Newcomers are introduced to the field systematically and guided to the frontiers of current research. Researchers already active in the field will appreciate the book as a valuable source of reference
|