Skip to main content Accessibility help
×
  • Cited by 36
    • Show more authors
    • You may already have access via personal or institutional login
    • Select format
    • Publisher:
      Cambridge University Press
      Publication date:
      June 2013
      June 2010
      ISBN:
      9780511780448
      9780521847520
      Dimensions:
      (234 x 156 mm)
      Weight & Pages:
      1.22kg, 780 Pages
      Dimensions:
      Weight & Pages:
    You may already have access via personal or institutional login
  • Selected: Digital
    Add to cart View cart Buy from Cambridge.org

    Book description

    This collection of papers presents a series of in-depth examinations of a variety of advanced topics related to Boolean functions and expressions. The chapters are written by some of the most prominent experts in their respective fields and cover topics ranging from algebra and propositional logic to learning theory, cryptography, computational complexity, electrical engineering, and reliability theory. Beyond the diversity of the questions raised and investigated in different chapters, a remarkable feature of the collection is the common thread created by the fundamental language, concepts, models, and tools provided by Boolean theory. Many readers will be surprised to discover the countless links between seemingly remote topics discussed in various chapters of the book. This text will help them draw on such connections to further their understanding of their own scientific discipline and to explore new avenues for research.

    Reviews

    ' … is likely to become the reference book for applications of Boolean functions. A common effort of twenty two authors and two editors, leading experts in their fields, the monograph, over 700 pages long, covers all important topics and presents state-of-the-art of applications of Boolean functions. This well written volume can be useful to graduate students, researchers in discrete mathematics, computer science, or other fields, as well as practitioners of operations research and combinatorial optimization. Also readers like me, who want to learn more about Boolean functions, will find this volume very informative.'

    Marcin Kaminski Source: SIGACT News

    Refine List

    Actions for selected content:

    Select all | Deselect all
    • View selected items
    • Export citations
    • Download PDF (zip)
    • Save to Kindle
    • Save to Dropbox
    • Save to Google Drive

    Save Search

    You can save your searches here and later view and run them again in "My saved searches".

    Please provide a title, maximum of 40 characters.
    ×

    Contents

    Metrics

    Altmetric attention score

    Full text views

    Total number of HTML views: 0
    Total number of PDF views: 0 *
    Loading metrics...

    Book summary page views

    Total views: 0 *
    Loading metrics...

    * Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

    Usage data cannot currently be displayed.

    Accessibility standard: Unknown

    Why this information is here

    This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.

    Accessibility Information

    Accessibility compliance for the PDF of this book is currently unknown and may be updated in the future.