EUR 133,45
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 2012 edition. 620 pages. 9.00x6.10x1.30 inches. In Stock.
Editore: Springer Berlin Heidelberg, 2014
ISBN 10: 3642431445 ISBN 13: 9783642431449
Lingua: Inglese
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 85,59
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. 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.
Editore: Springer Berlin Heidelberg, 2012
ISBN 10: 3642245072 ISBN 13: 9783642245077
Lingua: Inglese
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 117,69
Quantità: 1 disponibili
Aggiungi al carrelloBuch. 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.
Da: Mispah books, Redhill, SURRE, Regno Unito
EUR 157,87
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Like New. Like New. book.
Da: Mispah books, Redhill, SURRE, Regno Unito
EUR 203,48
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Like New. Like New. book.
Da: preigu, Osnabrück, Germania
EUR 102,30
Quantità: 5 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Boolean Function Complexity | Advances and Frontiers | Stasys Jukna | Buch | xvi | Englisch | 2012 | Springer-Verlag GmbH | EAN 9783642245077 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.