ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Review of "Boolean Functions and Computation Models by Peter Clote and Evangelos Kranakis", Springer-Verlag, 2002
Full text PdfPdf (600 KB)
Source ACM SIGACT News archive
Volume 35 ,  Issue 4  (December 2004) table of contents
COLUMN: Book reviews table of contents
Pages: 5 - 11  
Year of Publication: 2004
ISSN:0163-5700
Author
R. Gregory Taylor  Manhattan College
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 12,   Citation Count: 0
Additional Information:

abstract   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1054916.1054922
What is a DOI?

ABSTRACT

This wide-ranging monograph covers a number of research areas including Boolean functions and Boolean circuit families, propositional proof systems, sequential and parallel models of computation, and function algebras. If anything links them all together, it is surely complexity.

Collaborative Colleagues:
R. Gregory Taylor: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player