×







We sell 100% Genuine & New Books only!

Boolean Functions Theory Algorithms and Applications 2014 Edition at Meripustak

Boolean Functions Theory Algorithms and Applications 2014 Edition by Yves Crama, Peter L. Hammer , CAMBRIDGE

Books from same Author: Yves Crama, Peter L. Hammer

Books from same Publisher: CAMBRIDGE

Related Category: Author List / Publisher List


  • Price: ₹ 15103.00/- [ 17.00% off ]

    Seller Price: ₹ 12535.00

Estimated Delivery Time : 4-5 Business Days

Sold By: Meripustak      Click for Bulk Order

Free Shipping (for orders above ₹ 499) *T&C apply.

In Stock

We deliver across all postal codes in India

Orders Outside India


Add To Cart


Outside India Order Estimated Delivery Time
7-10 Business Days


  • We Deliver Across 100+ Countries

  • MeriPustak’s Books are 100% New & Original
  • General Information  
    Author(s)Yves Crama, Peter L. Hammer
    PublisherCAMBRIDGE
    ISBN9780521847513
    Pages710
    BindingHardback
    LanguageEnglish
    Publish YearFebruary 2014

    Description

    CAMBRIDGE Boolean Functions Theory Algorithms and Applications 2014 Edition by Yves Crama, Peter L. Hammer

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



    Book Successfully Added To Your Cart