|
|
|
|
| LEADER |
03152nam a22005175i 4500 |
| 001 |
978-3-540-27477-3 |
| 003 |
DE-He213 |
| 005 |
20151204161831.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2005 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540274773
|9 978-3-540-27477-3
|
| 024 |
7 |
|
|a 10.1007/3-540-27477-4
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA76.6-76.66
|
| 072 |
|
7 |
|a UM
|2 bicssc
|
| 072 |
|
7 |
|a COM051000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 005.11
|2 23
|
| 100 |
1 |
|
|a Wegener, Ingo.
|e author.
|
| 245 |
1 |
0 |
|a Complexity Theory
|h [electronic resource] :
|b Exploring the Limits of Efficient Algorithms /
|c by Ingo Wegener.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2005.
|
| 300 |
|
|
|a XII, 308 p. 18 illus.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 505 |
0 |
|
|a Algorithmic Problems & Their Complexity -- Fundamental Complexity Classes -- Reductions — Algorithmic Relationships Between Problems -- The Theory of NP-Completeness -- NP-complete and NP-equivalent Problems -- The Complexity Analysis of Problems -- The Complexity of Approximation Problems — Classical Results -- The Complexity of Black Box Problems -- Additional Complexity Classes and Relationships Between Complexity Classes -- Interactive Proofs -- The PCP Theorem and the Complexity of Approximation Problems -- Further Topics From Classical Complexity Theory -- The Complexity of Non-uniform Problems -- Communication Complexity -- The Complexity of Boolean Functions.
|
| 520 |
|
|
|a Complexity theory is the theory of determining the necessary resources for the solution of algorithmic problems and, therefore, the limits of what is possible with the available resources. An understanding of these limits prevents the search for non-existing efficient algorithms. This textbook considers randomization as a key concept and emphasizes the interplay between theory and practice: New branches of complexity theory continue to arise in response to new algorithmic concepts, and its results - such as the theory of NP-completeness - have influenced the development of all areas of computer science. The topics selected have implications for concrete applications, and the significance of complexity theory for today's computer science is stressed throughout.
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Computer programming.
|
| 650 |
|
0 |
|a Coding theory.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Computer logic.
|
| 650 |
|
0 |
|a Mathematical logic.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Programming Techniques.
|
| 650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
| 650 |
2 |
4 |
|a Coding and Information Theory.
|
| 650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
| 650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
| 650 |
2 |
4 |
|a Algorithms.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540210450
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/3-540-27477-4
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
