,

Boolean Functions and Computation Models

Paperback Engels 2010 9783642082177
Verwachte levertijd ongeveer 9 werkdagen

Samenvatting

The two internationally renowned authors elucidate the structure of "fast" parallel computation. Its complexity is emphasised through a variety of techniques ranging from finite combinatorics, probability theory and finite group theory to finite model theory and proof theory. Non-uniform computation models are studied in the form of Boolean circuits; uniform ones in a variety of forms. Steps in the investigation of non-deterministic polynomial time are surveyed as is the complexity of various proof systems. Providing a survey of research in the field, the book will benefit advanced undergraduates and graduate students as well as researchers.

Specificaties

ISBN13:9783642082177
Taal:Engels
Bindwijze:paperback
Aantal pagina's:602
Uitgever:Springer Berlin Heidelberg
Druk:0

Lezersrecensies

Wees de eerste die een lezersrecensie schrijft!

Inhoudsopgave

1. Boolean Functions and Circuits.- 2. Circuit Lower Bounds.- 3. Circuit Upper Bounds.- 4. Randomness and Satisfiability.- 5. Propositional Proof Systems.- 6. Machine Models and Function Algebras.- 7. Higher Types.- References.

Managementboek Top 100

Rubrieken

    Personen

      Trefwoorden

        Boolean Functions and Computation Models