|
|
|
|
| LEADER |
01104nam a2200217 u 4500 |
| 001 |
10106877 |
| 003 |
upatras |
| 005 |
20160425001921.0 |
| 008 |
030521s |
| 020 |
|
|
|a 3 540 64310 9
|
| 245 |
1 |
0 |
|a Introduction to Circuit Complexity
|b A Uniform Approach
|c Heribert Vollmer
|
| 260 |
|
|
|a Berlin
|b Springer - Verlag
|c 1999
|
| 300 |
|
|
|a xi, 270 p., fig.
|
| 490 |
1 |
|
|a Texts in Theoretical Computer Science An EATCS Series / W. Brauer, G. Rozenberg, A. Salomaa Eds.
|
| 504 |
|
|
|a Bibliography pp. 241-253, Author Index pp. 257-259, Subject Index pp. 261-270
|
| 505 |
1 |
|
|a contents: Introduction, 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, Bibliography, List of figures, Author index, Subject index.
|
| 700 |
1 |
|
|a Vollmer, Heribert
|4 aut
|9 4071
|
| 852 |
|
|
|a GR-PaULI
|b ΠΑΤΡΑ
|b ΤΜΗΥΠ
|t 1
|
| 942 |
|
|
|2 ddc
|
| 952 |
|
|
|0 0
|1 0
|4 0
|7 0
|9 141807
|a CEID
|b CEID
|d 2016-04-24
|l 0
|r 2016-04-24 00:00:00
|t 1
|w 2016-04-24
|
| 999 |
|
|
|c 92771
|d 92771
|
