Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Die angezeigten Daten werden derzeit aktualisiert.
Derzeit steht der Fernleihindex leider nicht zur Verfügung.
Export
  • 1
    Online Resource
    Online Resource
    Berlin : Springer
    UID:
    gbv_749300930
    Format: Online-Ressource (XIV, 602 p) , digital
    Edition: Springer eBook Collection. Computer Science
    ISBN: 9783662049433
    Series Statement: Texts in Theoretical Computer Science. An EATCS Series
    Content: This textbook presents a survey of research on boolean functions, circuits, parallel computation models, function algebras, and proof systems. Its main aim is to elucidate the structure of "fast" parallel computation. The complexity of parallel computation is emphasized through a variety of techniques ranging from finite combinatorics, probability theory, and finite group theory to finite model theory and proof theory. Nonuniform 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. The book will benefit advanced undergraduate and graduate students as well as researchers in the field of complexity theory
    Additional Edition: ISBN 9783642082177
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783642082177
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783540594369
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9783662049440
    Language: English
    URL: Volltext  (lizenzpflichtig)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages