Kaikki kirjat 25 % alennuksella koodilla: BOOKS

  • check Yli 10 miljoonaa kirjaa
  • check Uutuuksia joka päivä
  • check Yli 1 miljoona asiakasta luottaa meihin
  • check Hyvät hinnat ja alennukset
  • check Toimitus koko Eurooppaan

Boolean Function Complexity: Advances and Frontiers - Stasys Jukna

englanti
2014-02-22
98,98 € 131,98 €

-25% koodilla BOOKS

Toimittajalla varastossa

Toimitus 12-18 arkipäivässä

30 päivän palautusoikeus

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 Waterloö that have been discovered over the past several decades, right up to results from the last year or two. Many open probl ... Täydellinen kuvaus

Saatat myös pitää

Kuvaus

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

Lisätietoja

Kirjoittaja Stasys Jukna
Julkaisija Springer Berlin Heidelberg
Series Algorithms and Combinatorics
Julkaisuvuosi 2014
Kannen tyyppi Pehmeäkantinen
EAN 9783642431449
Kirjoita oma arvostelusi
Arvostelet: Boolean Function Complexity: Advances and Frontiers
Arvostelusi:

Goodreads-arvostelut

98,98 € 131,98 €