✍️ 🧑‍🦱 💚 Autor:innen verdienen bei uns doppelt. Dank euch haben sie so schon 362.450 € mehr verdient. → Mehr erfahren 💪 📚 🙏

Boolean Function Complexity

von Stasys Jukna
Hardcover - 9783642245077
85,59 €
  • Versandkostenfrei
Auf meine Merkliste
  • Hinweis: Print on Demand. Lieferbar in 7 Tagen.
  • Lieferzeit nach Versand: ca. 1-2 Tage
  • inkl. MwSt. & Versandkosten (innerhalb Deutschlands)

Weitere Formate

Softcover - 9783642431449
85,59 €

Autorenfreundlich Bücher kaufen?!

Weitere Formate

Softcover - 9783642431449
85,59 €

Beschreibung

Boolean circuit complexity is the combinatorics of computer science and involves many intriguing problems that are easy to state and explain, even for the layman. This book is a comprehensive  description of basic lower bound arguments, covering many of the gems of this “complexity Waterloo” that have been discovered over the past several decades, right up to results from the last year or two. Many open problems, marked as Research Problems, are mentioned along the way. The problems are mainly of combinatorial flavor but their solutions could have great consequences in circuit complexity and computer science. The book will be of interest to graduate students and researchers in the fields of computer science and discrete mathematics.

Advances and Frontiers

Advances and Frontiers

Details

Verlag Springer Berlin
Ersterscheinung 06. Januar 2012
Maße 23.5 cm x 15.5 cm
Gewicht 1109 Gramm
Format Hardcover
ISBN-13 9783642245077
Seiten 620

Herstellerinformationen +