Skip to content
Register Sign in Wishlist

Boolean Functions
Theory, Algorithms, and Applications

£130.00

Part of Encyclopedia of Mathematics and its Applications

Peter L. Hammer, Alexander Kogan, Yves Crama, Kazuhisa Makino, Bruno Simeone, Endre Boros, Martin C. Golumbic, Vladimir Gurvich, Lisa Hellerstein, Toshihide Ibaraki, Claude Benzaken, Nadia Brauner
View all contributors
  • Date Published: July 2011
  • availability: Available
  • format: Hardback
  • isbn: 9780521847513

£ 130.00
Hardback

Add to cart Add to wishlist

Other available formats:
eBook


Looking for an inspection copy?

This title is not currently available on inspection

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • Written by prominent experts in the field, this monograph provides the first comprehensive, unified presentation of the structural, algorithmic and applied aspects of the theory of Boolean functions. The book focuses on algebraic representations of Boolean functions, especially disjunctive and conjunctive normal form representations. This framework looks at the fundamental elements of the theory (Boolean equations and satisfiability problems, prime implicants and associated short representations, dualization), an in-depth study of special classes of Boolean functions (quadratic, Horn, shellable, regular, threshold, read-once functions and their characterization by functional equations) and two fruitful generalizations of the concept of Boolean functions (partially defined functions and pseudo-Boolean functions). Several topics are presented here in book form for the first time. Because of the depth and breadth and its emphasis on algorithms and applications, this monograph will have special appeal for researchers and graduate students in discrete mathematics, operations research, computer science, engineering and economics.

    • The breadth and comprehensiveness of coverage reflects special expertise of authors
    • This book emphases algorithms and applications
    Read more

    Reviews & endorsements

    'Because of the unique depth and breadth of the unified treatment that it provides and its emphasis on algorithms and applications, this monograph and its companion book [Boolean Models and Methods in Mathematics, Computer Science and Engineering] will have special appeal for a large circle of readers.' Sergiu Rudeanu, Zentralblatt MATH

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: July 2011
    • format: Hardback
    • isbn: 9780521847513
    • length: 710 pages
    • dimensions: 234 x 156 x 43 mm
    • weight: 1.26kg
    • contains: 98 b/w illus. 227 exercises
    • availability: Available
  • Table of Contents

    Part I. Foundations:
    1. Fundamental concepts and applications
    2. Boolean equations
    3. Prime implicants and minimal DNFs Peter L. Hammer and Alexander Kogan
    4. Duality theory Yves Crama and Kazuhisa Makino
    Part II. Special Classes:
    5. Quadratic functions Bruno Simeone
    6. Horn functions Endre Boros
    7. Orthogonal forms and shellability
    8. Regular functions
    9. Threshold functions
    10. Read-once functions Martin C. Golumbic and Vladimir Gurvich
    11. Characterizations of special classes by functional equations Lisa Hellerstein
    Part III. Generalizations:
    12. Partially defined Boolean functions Toshihide Ibaraki
    13. Pseudo-Boolean functions
    Appendix A. Graphs and hypergraphs
    Appendix B. Algorithmic complexity
    Appendix C. JBool: a software tool Claude Benzaken and Nadia Brauner.

  • Authors

    Yves Crama, Université de Liège, Belgium
    Dr Yves Crama is Professor of Operations Research and Production Management and the former Director General of the HEC Management School of the University of Liège, Belgium. He is widely recognized as a prominent expert in the field of Boolean functions, combinatorial optimization and operations research, and he has coauthored more than 70 papers and three books on these subjects. Dr Crama is a member of the Editorial Board of Discrete Applied Mathematics, Discrete Optimization, the Journal of Scheduling and 4OR - the quarterly journal of the Belgian, French and Italian Operations Research Societies.

    Peter L. Hammer, Rutgers University, New Jersey
    The late Peter L. Hammer (1936–2006) was a Professor of Operations Research, Mathematics, Computer Science, Management Science and Information Systems at Rutgers University and the Director of Rutgers University Center for Operations Research (RUTCOR). He was the founder and Editor-in-Chief of the journals Annals of Operations Research, Discrete Mathematics, Discrete Applied Mathematics, Discrete Optimization and Electronic Notes in Discrete Mathematics. Dr Hammer was the initiator of numerous pioneering investigations of the use of Boolean functions in operations research and related areas, of the theory of pseudo-Boolean functions, and of the logical analysis of data. He published more than 240 papers and 19 books on these topics.

    Contributors

    Peter L. Hammer, Alexander Kogan, Yves Crama, Kazuhisa Makino, Bruno Simeone, Endre Boros, Martin C. Golumbic, Vladimir Gurvich, Lisa Hellerstein, Toshihide Ibaraki, Claude Benzaken, Nadia Brauner

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×