Boolean Functions and Computation Models (2002) (Texts in Theoretical Computer Science. An EATCS Series)
By: and
Sign Up Now!
Already a Member? Log In
You must be logged into UK education collection to access this title.
Learn about membership options,
or view our freely available titles.
- Synopsis
- 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.
- Copyright:
- 2002
Book Details
- Book Quality:
- Publisher Quality
- ISBN-13:
- 9783662049433
- Related ISBNs:
- 9783540594369
- Publisher:
- Springer Berlin Heidelberg
- Date of Addition:
- 07/28/22
- Copyrighted By:
- N/A
- Adult content:
- No
- Language:
- English
- Has Image Descriptions:
- No
- Categories:
- Nonfiction, Computers and Internet, Mathematics and Statistics, Philosophy
- Submitted By:
- Bookshare Staff
- Usage Restrictions:
- This is a copyrighted book.
Reviews
Other Books
- by Peter Clote
- by Evangelos Kranakis
- in Nonfiction
- in Computers and Internet
- in Mathematics and Statistics
- in Philosophy