Boolean Models and Methods in Mathematics, Computer Science, and Engineering
Herausgeber: Crama, Yves; Yves, Crama; Hammer, Peter L.
Boolean Models and Methods in Mathematics, Computer Science, and Engineering
Herausgeber: Crama, Yves; Yves, Crama; Hammer, Peter L.
- Gebundenes Buch
- Merkliste
- Auf die Merkliste
- Bewerten Bewerten
- Teilen
- Produkt teilen
- Produkterinnerung
- Produkterinnerung
A collection of papers written by prominent experts that examine a variety of advanced topics related to Boolean functions and expressions.
Andere Kunden interessierten sich auch für
- Boolean Algebra35,99 €
- Boolean Algebra and Its Applications36,99 €
- Julio César Martínez RomeroBoolean Algebra Is for Children31,99 €
- Yves DiersCategories of Boolean Sheaves of Simple Algebras21,99 €
- Sergei S. GoncharovCountable Boolean Algebras and Decidability125,99 €
- Julio César Martínez RomeroBoolean Algebra Is for Children15,99 €
- Paul R. HalmosLectures on Boolean Algebras19,99 €
-
-
-
A collection of papers written by prominent experts that examine a variety of advanced topics related to Boolean functions and expressions.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
Produktdetails
- Produktdetails
- Verlag: Cambridge University Press
- Seitenzahl: 780
- Erscheinungstermin: 1. Juni 2010
- Englisch
- Abmessung: 240mm x 161mm x 50mm
- Gewicht: 1464g
- ISBN-13: 9780521847520
- ISBN-10: 0521847524
- Artikelnr.: 29011529
- Herstellerkennzeichnung
- Books on Demand GmbH
- In de Tarpen 42
- 22848 Norderstedt
- info@bod.de
- 040 53433511
- Verlag: Cambridge University Press
- Seitenzahl: 780
- Erscheinungstermin: 1. Juni 2010
- Englisch
- Abmessung: 240mm x 161mm x 50mm
- Gewicht: 1464g
- ISBN-13: 9780521847520
- ISBN-10: 0521847524
- Artikelnr.: 29011529
- Herstellerkennzeichnung
- Books on Demand GmbH
- In de Tarpen 42
- 22848 Norderstedt
- info@bod.de
- 040 53433511
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.
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.
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.
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.