Author

Contributions

  • Kranakis, Evangelos - Contributor

Publication

2002 - Springer Berlin Heidelberg, Berlin, Heidelberg, Germany

Language

English

Word Count

150,500 words, Guess

Page Count

602 pages

Physical Format

Electronic resource

Identifiers

and 4 more
  • OCLC Control Number851389270
  • Better World Books9783642082177
  • Better World Books9783662049433
  • Open LibraryOL27021953M

Classifications

  • DDC004.0151
  • LCCQA75.5-76.95
  • LCCQA76.9.S88

Description

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.

Subjects

Series Statement

  • Texts in Theoretical Computer Science. An EATCS Series

Reader Reviews

No reviews yet for this book.

Be the first to share your thoughts!