Articoli correlati a Boolean Function Complexity: Advances and Frontiers:...
Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Informazioni sull?autore
http://www.thi.informatik.uni-frankfurt.de/~jukna/
Dalla quarta di copertina
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 98,54
EUR 9,70 per la spedizione da Germania a Italia
Destinazione, tempi e costi
Risultati della ricerca per Boolean Function Complexity: Advances and Frontiers:...
Immagini fornite dal venditore
Boolean Function Complexity
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Gebunden. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This is the first book covering the happening in circuit complexity during the last 20 yearsIncludes non-standard topics, like graph complexity or circuits with arbitrary gates Includes about 40 open problems as potential research topics fo. Codice articolo 5053590
Quantità: Più di 20 disponibili
Foto dell'editore
Jukna:Boolean Function Complexity (eng)
Print on DemandDa: Brook Bookstore On Demand, Napoli, NA, Italia
Valutazione del venditore 4 su 5 stelle
Condizione: new. Questo è un articolo print on demand. Codice articolo ae7c5c5a258c36e2ba3e71c4f6dbfb59
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Boolean Function Complexity
Editore:
Springer Berlin Heidelberg Jan 2012, 2012
ISBN 10: 3642245072
ISBN 13: 9783642245077
Nuovo
Rilegato
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 636 pp. Englisch. Codice articolo 9783642245077
Quantità: 2 disponibili
Immagini fornite dal venditore
Boolean Function Complexity : Advances and Frontiers
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Codice articolo 9783642245077
Quantità: 1 disponibili
Immagini fornite dal venditore
Boolean Function Complexity
ISBN 10: 3642245072
ISBN 13: 9783642245077
Nuovo
Rilegato
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 636 pp. Englisch. Codice articolo 9783642245077
Quantità: 2 disponibili
Foto dell'editore
Boolean Function Complexity: Advances and Frontiers (Algorithms and Combinatorics, Vol. 27)
Da: Mispah books, Redhill, SURRE, Regno Unito
Valutazione del venditore 4 su 5 stelle
Hardcover. Condizione: Like New. Like New. book. Codice articolo ERICA79036422450726
Quantità: 1 disponibili