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

Crama, Yves (Editor)/ Hammer, Peter L. (Editor)

ISBN 10: 0521847524 / ISBN 13: 9780521847520

Editore: Cambridge Univ Pr, 2010

Riguardo questo articolo

1st edition. 776 pages. 9.75x6.50x2.00 inches. In Stock. Codice articolo x-0521847524

Dati bibliografici

Titolo: Boolean Models and Methods in Mathematics, ...

Casa editrice: Cambridge Univ Pr

Data di pubblicazione: 2010

Legatura: Hardcover

Condizione: Brand New

Descrizione articolo

Riassunto:

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.

Recensione:

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