Advertisement

Boolean Functions and Computation Models

  • Peter Clote
  • Evangelos Kranakis

Table of contents

  1. Front Matter
    Pages I-XIV
  2. Peter Clote, Evangelos Kranakis
    Pages 1-60
  3. Peter Clote, Evangelos Kranakis
    Pages 61-154
  4. Peter Clote, Evangelos Kranakis
    Pages 155-205
  5. Peter Clote, Evangelos Kranakis
    Pages 207-245
  6. Peter Clote, Evangelos Kranakis
    Pages 247-412
  7. Peter Clote, Evangelos Kranakis
    Pages 413-495
  8. Peter Clote, Evangelos Kranakis
    Pages 497-567
  9. Back Matter
    Pages 569-602

About this book

Introduction

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.

Keywords

Beweissysteme Boolean function Boolesche Funktionen Erfüllbarkeitsproblem der Aussagenlogik Komplexitätstheorie Paralleles Rechnen combinatorics complexity complexity theory proof theory

Authors and affiliations

  • Peter Clote
    • 1
  • Evangelos Kranakis
    • 2
  1. 1.Department of Computer Science and Department of BiologyBoston CollegeChestnut HillUSA
  2. 2.School of Computer ScienceCarleton UniversityOttawaCanada

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-662-04943-3
  • Copyright Information Springer-Verlag Berlin Heidelberg 2002
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-642-08217-7
  • Online ISBN 978-3-662-04943-3
  • Series Print ISSN 1862-4499
  • Buy this book on publisher's site