did-you-know? rent-now

Amazon no longer offers textbook rentals. We do!

did-you-know? rent-now

Amazon no longer offers textbook rentals. We do!

We're the #1 textbook rental company. Let us show you why.

9780521847513

Boolean Functions: Theory, Algorithms, and Applications

by
  • ISBN13:

    9780521847513

  • ISBN10:

    0521847516

  • Format: Hardcover
  • Copyright: 2011-05-16
  • Publisher: Cambridge University Press

Note: Supplemental materials are not guaranteed with Rental or Used book purchases.

Purchase Benefits

  • Free Shipping Icon Free Shipping On Orders Over $35!
    Your order must be $35 or more to qualify for free economy shipping. Bulk sales, PO's, Marketplace items, eBooks and apparel do not qualify for this offer.
  • eCampus.com Logo Get Rewarded for Ordering Your Textbooks! Enroll Now
  • Write a Review Icon Write a Review
List Price: $182.00 Save up to $67.34
  • Rent Book $114.66
    Add to Cart Free Shipping Icon Free Shipping

    TERM
    PRICE
    DUE
    SPECIAL ORDER: 1-2 WEEKS
    *This item is part of an exclusive publisher rental program and requires an additional convenience fee. This fee will be reflected in the shopping cart.

Supplemental Materials

What is included with this book?

Summary

Written by some of the most prominent experts in the field, this book provides the first comprehensive presentation of the theoretical, algorithmic and applied aspects of Boolean functions. It presents the fundamental elements of the theory (Boolean equations and satisfiability problems, prime implicants and associated representations, dualization, decomposition), an in-depth study of special classes of Boolean functions (quadratic, Horn, shellable, regular, threshold, read-once), and two fruitful generalizations of the concept of Boolean functions (partially defined and pseudo-Boolean functions). The book contains applications of Boolean methods in all areas where they play a significant role, including propositional logic, combinatorics, graph and hypergraph theory, complexity theory, integer programming, combinatorial optimization, game theory, reliability theory, electrical and computer engineering and artificial intelligence. Its unique depth and breadth and its emphasis on algorithms and applications will make this a key reference for researchers and graduate students in discrete mathematics, operations research, computer science, engineering, and economics.

Table of Contents

Part I. Foundations: 1. Fundamental concepts and applications; 2. Boolean equations; 3. Prime implicants and minimal DNFs; 4. Duality theory; 5. Decomposition; Part II. Special classes: 6. Quadratic functions; 7. Horn functions; 8. Orthogonal forms and shellability; 9. Regular functions; 10. Threshold functions; 11. Convex functions; 12. Read-once functions; 13. Decomposition, approximation and other special classes; 14. Equational characterizations of special classes; Part III. Generalizations: 15. Partially defined Boolean functions; 16. Pseudo-Boolean functions; Appendix 1. Software section; Appendix 2. Algorithmic complexity.

Supplemental Materials

What is included with this book?

The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.

The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.

Rewards Program