Cantitate/Preț
Produs

Boolean Models and Methods in Mathematics, Computer Science, and Engineering: Encyclopedia of Mathematics and its Applications, cartea 134

Editat de Yves Crama, Peter L. Hammer
en Limba Engleză Hardback – 27 iun 2010
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.
Citește tot Restrânge

Din seria Encyclopedia of Mathematics and its Applications

Preț: 80516 lei

Preț vechi: 93623 lei
-14% Nou

Puncte Express: 1208

Preț estimativ în valută:
15409 15897$ 13041£

Carte tipărită la comandă

Livrare economică 04-18 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780521847520
ISBN-10: 0521847524
Pagini: 780
Ilustrații: 91 b/w illus. 7 tables
Dimensiuni: 163 x 243 x 47 mm
Greutate: 1.25 kg
Ediția:New.
Editura: Cambridge University Press
Colecția Cambridge University Press
Seria Encyclopedia of Mathematics and its Applications

Locul publicării:New York, United States

Cuprins

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.

Recenzii

' … 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, SIGACT News

Descriere

A collection of papers written by prominent experts that examine a variety of advanced topics related to Boolean functions and expressions.