Authors:
- A survey of the present state of the art by internationally well-known authors
- Focus on "fast" parallel computation
- Includes numerous exercises ranging in difficulty
- Includes supplementary material: sn.pub/extras
Part of the book series: Texts in Theoretical Computer Science. An EATCS Series (TTCS)
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (7 chapters)
-
Front Matter
-
Back Matter
About this book
Reviews
From the reviews:
"The monograph gives the most recent and complete description of lower bounds for depth-restricted circuits, and propositional proof systems. … the authors present a research monograph on important subjects and provide many very recent results. I would recommend it for any university library and also for researchers." (Ingo Wegener, The Computer Journal, Vol. 46 (3), 2003)
Authors and Affiliations
-
Department of Computer Science and Department of Biology, Boston College, Chestnut Hill, USA
Peter Clote
-
School of Computer Science, Carleton University, Ottawa, Canada
Evangelos Kranakis
Bibliographic Information
Book Title: Boolean Functions and Computation Models
Authors: Peter Clote, Evangelos Kranakis
Series Title: Texts in Theoretical Computer Science. An EATCS Series
DOI: https://doi.org/10.1007/978-3-662-04943-3
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 2002
Hardcover ISBN: 978-3-540-59436-9Published: 19 September 2002
Softcover ISBN: 978-3-642-08217-7Published: 21 October 2010
eBook ISBN: 978-3-662-04943-3Published: 09 March 2013
Series ISSN: 1862-4499
Series E-ISSN: 1862-4502
Edition Number: 1
Number of Pages: XIV, 602
Topics: Computer System Implementation, Computation by Abstract Devices, Mathematical Logic and Formal Languages, Programming Techniques, Mathematical Logic and Foundations