Introduction to Circuit Complexity

A Uniform Approach

Specificaties
Gebonden, 272 blz. | Engels
Springer Berlin Heidelberg | 1999e druk, 1999
ISBN13: 9783540643104
Rubricering
Springer Berlin Heidelberg 1999e druk, 1999 9783540643104
Verwachte levertijd ongeveer 9 werkdagen

Samenvatting

An advanced textbook giving a broad, modern view of the computational complexity theory of boolean circuits, with extensive references, for theoretical computer scientists and mathematicians.

Specificaties

ISBN13:9783540643104
Taal:Engels
Bindwijze:gebonden
Aantal pagina's:272
Uitgever:Springer Berlin Heidelberg
Druk:1999

Inhoudsopgave

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.

Rubrieken

    Personen

      Trefwoorden

        Introduction to Circuit Complexity