Skip to content
Open global navigation

Cambridge University Press

AcademicLocation selectorSearch toggleMain navigation toggle
Cart
Register Sign in Wishlist

Boolean Models and Methods in Mathematics, Computer Science, and Engineering

$190.00 (C)

Part of Encyclopedia of Mathematics and its Applications

Reinhard Pöschel, Ivo Rosenberg, Jan C. Bioch, Alasdair Urquhart, John Franco, John Hooker, Martin Anthony, Robert H. Sloan, Balázs Szörényi, György Turán, Claude Carlet, Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener, Matthias Krause, Jehoshua Bruck, J. H. Roland Jiang, Tiziano Villa, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli, Charles J. Colbourn
View all contributors
  • Date Published: June 2010
  • availability: In stock
  • format: Hardback
  • isbn: 9780521847520

$190.00 (C)
Hardback

Add to cart Add to wishlist

Looking for an examination copy?

This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
About the Authors
  • 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.

    • Emphasis on algorithms and applications
    • Authors are the leading experts in this field
    Read more

    Reviews & endorsements

    "The book is well written and its homogeneous presentation is laudable. On the whole, this is a useful book that will serve as a textbook and reference."
    S.V. Nagaraj, Computing Reviews

    "The editors were effective in ensuring that the presentation style throughout the chapters was uniform."
    Dominique de Werra for Interfaces

    "...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, University of Warsaw, SIGACT News

    See more reviews

    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: June 2010
    • format: Hardback
    • isbn: 9780521847520
    • length: 780 pages
    • dimensions: 234 x 156 x 48 mm
    • weight: 1.27kg
    • contains: 91 b/w illus. 7 tables
    • availability: In stock
  • Table of Contents

    Part I. Algebraic Structures:
    1. Compositions and clones of Boolean functions Reinhard Pöschel and Ivo Rosenberg
    2. Decomposition of Boolean functions Jan C. Bioch
    Part II. Logic:
    3. Proof theory Alasdair Urquhart
    4. Probabilistic analysis of satisfiability algorithms John Franco
    5. Optimization methods in logic John Hooker
    Part III. Learning Theory and Cryptography:
    6. Probabilistic learning and Boolean functions Martin Anthony
    7. Learning Boolean functions with queries Robert H. Sloan, Balázs Szörényi and György Turán
    8. Boolean functions for cryptography and error-correcting codes Claude Carlet
    9. Vectorial Boolean functions for cryptography Claude Carlet
    Part IV. Graph Representations and Efficient Computation Models:
    10. Binary decision diagrams Beate Bollig, Martin Sauerhoff, Detlef Sieling and Ingo Wegener
    11. Circuit complexity Matthias Krause and Ingo Wegener
    12. Fourier transforms and threshold circuit complexity Jehoshua Bruck
    13. Neural networks and Boolean functions Martin Anthony
    14. Decision lists and related classes of Boolean functions Martin Anthony
    Part V. Applications in Engineering:
    15. Hardware equivalence and property verification J. H. Roland Jiang and Tiziano Villa
    16. Synthesis of multi-level Boolean networks Tiziano Villa, Robert K. Brayton and Alberto L. Sangiovanni-Vincentelli
    17. Boolean aspects of network reliability Charles J. Colbourn.

  • Editors

    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 on these subjects. Dr Crama is a member of the Editorial Board of Discrete Optimization, Journal of Scheduling, and 4OR – The Quarterly Journal of the Belgian, French and Italian Operations Research Societies.

    Peter L. Hammer
    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 the 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 has published more than 240 papers and 19 books on these topics.

    Contributors

    Reinhard Pöschel, Ivo Rosenberg, Jan C. Bioch, Alasdair Urquhart, John Franco, John Hooker, Martin Anthony, Robert H. Sloan, Balázs Szörényi, György Turán, Claude Carlet, Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener, Matthias Krause, Jehoshua Bruck, J. H. Roland Jiang, Tiziano Villa, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli, Charles J. Colbourn

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

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 ×

Find content that relates to you

Join us online

© Cambridge University Press 2014

Back to top

Are you sure you want to delete your account?

This cannot be undone.

Cancel Delete

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.
×