|
|
|
|
| LEADER |
02568nmm a2200361 u 4500 |
| 001 |
EB000686467 |
| 003 |
EBX01000000000000001350113 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783662039274
|
| 100 |
1 |
|
|a Vollmer, Heribert
|
| 245 |
0 |
0 |
|a Introduction to Circuit Complexity
|h Elektronische Ressource
|b A Uniform Approach
|c by Heribert Vollmer
|
| 250 |
|
|
|a 1st ed. 1999
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 1999, 1999
|
| 300 |
|
|
|a XI, 272 p
|b online resource
|
| 505 |
0 |
|
|a 1. Complexity Measures and Reductions -- 2. Relations to Other Computation Models -- 3. Lower Bounds -- 4. The NC Hierarchy -- 5. Arithmetic Circuits -- 6. Polynomial Time and Beyond -- Appendix: Mathematical Preliminaries -- A1 Alphabets, Words, Languages -- A2 Binary Encoding -- A3 Asymptotic Behavior of Functions -- A4 Turing Machines -- A5 Logic -- A6 Graphs -- A7 Numbers and Functions -- A8 Algebraic Structures -- A9 Linear Algebra -- List of Figures -- Author Index
|
| 653 |
|
|
|a Electronics and Microelectronics, Instrumentation
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Computational Mathematics and Numerical Analysis
|
| 653 |
|
|
|a Mathematics / Data processing
|
| 653 |
|
|
|a Formal Languages and Automata Theory
|
| 653 |
|
|
|a Machine theory
|
| 653 |
|
|
|a Electronics
|
| 653 |
|
|
|a Theory of Computation
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Texts in Theoretical Computer Science. An EATCS Series
|
| 028 |
5 |
0 |
|a 10.1007/978-3-662-03927-4
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-662-03927-4?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 004.0151
|
| 520 |
|
|
|a This advanced textbook presents a broad and up-to-date view of the computational complexity theory of Boolean circuits. It combines the algorithmic and the computability-based approach, and includes extensive discussion of the literature to facilitate further study. It begins with efficient Boolean circuits for problems with high practical relevance, e.g., arithmetic operations, sorting, and transitive closure, then compares the computational model of Boolean circuits with other models such as Turing machines and parallel machines. Examination of the complexity of specific problems leads to the definition of complexity classes. The theory of circuit complexity classes is then thoroughly developed, including the theory of lower bounds and advanced topics such as connections to algebraic structures and to finite model theory
|