Tasuta kohaletoimetamine tellimustele üle 29 €
  • check 10+ miljonit raamatut
  • check Uued tooted iga päev
  • check Meid usaldab üle 1 miljoni kliendi
  • check Hea hind ja allahindlused
  • check Tarne üle kogu Euroopa

Boolean Function Complexity: Advances and Frontiers - Stasys Jukna

inglise keel
2014-02-22
92,39 € 131,98 €

-30% koodiga BOOKS

Meie tarnija laos

Saadetis 12-18 tööpäeva jooksul

30-päevane tagastamisõigus

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äielik kirjeldus

Võib-olla meeldib sulle ka

Kirjeldus

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.

Lisateave

Autor Stasys Jukna
Kirjastaja Springer Berlin Heidelberg
Series Algorithms and Combinatorics
Väljalaskeaasta 2014
Kaanetüüp Pehme kaanega
EAN 9783642431449
Kirjuta oma arvustus
Te vaatate: Boolean Function Complexity: Advances and Frontiers
Teie hinnang:

Goodreads'i arvustused

92,39 € 131,98 €