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.
Altre edizioni note dello stesso titolo
Risultati della ricerca per Boolean Function Complexity: Advances and Frontiers:...
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 f6a8568e618855bf020fc4681330e15e
Compra nuovo
EUR 70,24
Spese di spedizione:
EUR 8,00
Da: Italia a: U.S.A.
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Boolean Function Complexity
Editore:
Springer Berlin Heidelberg Feb 2014, 2014
ISBN 10: 3642431445
ISBN 13: 9783642431449
Nuovo
Taschenbuch
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. 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 9783642431449
Compra nuovo
EUR 85,59
Spese di spedizione:
EUR 23,00
Da: Germania a: U.S.A.
Quantità: 2 disponibili
Immagini fornite dal venditore
Boolean Function Complexity
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 4 su 5 stelle
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 5060606
Compra nuovo
EUR 72,89
Spese di spedizione:
EUR 48,99
Da: Germania a: U.S.A.
Quantità: Più di 20 disponibili
Foto dell'editore
Boolean Function Complexity
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. pp. xvi + 620 Index. Codice articolo 26142290286
Compra nuovo
EUR 124,02
Spese di spedizione:
EUR 3,45
In U.S.A.
Quantità: 4 disponibili
Foto dell'editore
Boolean Function Complexity
Print on DemandDa: Majestic Books, Hounslow, Regno Unito
Valutazione del venditore 4 su 5 stelle
Condizione: New. Print on Demand pp. xvi + 620 70 Illus. Codice articolo 135041713
Compra nuovo
EUR 130,49
Spese di spedizione:
EUR 7,40
Da: Regno Unito a: U.S.A.
Quantità: 4 disponibili
Foto dell'editore
Boolean Function Complexity
Print on DemandDa: Biblios, Frankfurt am main, HESSE, Germania
Valutazione del venditore 4 su 5 stelle
Condizione: New. PRINT ON DEMAND pp. xvi + 620 Epilogue. Codice articolo 18142290276
Compra nuovo
EUR 132,93
Spese di spedizione:
EUR 9,95
Da: Germania a: U.S.A.
Quantità: 4 disponibili
Immagini fornite dal venditore
Boolean Function Complexity
ISBN 10: 3642431445
ISBN 13: 9783642431449
Nuovo
Taschenbuch
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. 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 9783642431449
Compra nuovo
EUR 85,59
Spese di spedizione:
EUR 60,00
Da: Germania a: U.S.A.
Quantità: 2 disponibili
Immagini fornite dal venditore
Boolean Function Complexity | Advances and Frontiers
Da: preigu, Osnabrück, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. Boolean Function Complexity | Advances and Frontiers | Stasys Jukna | Taschenbuch | xvi | Englisch | 2014 | Springer-Verlag GmbH | EAN 9783642431449 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Codice articolo 105432965
Compra nuovo
EUR 75,70
Spese di spedizione:
EUR 70,00
Da: Germania a: U.S.A.
Quantità: 5 disponibili
Foto dell'editore
Boolean Function Complexity: Advances and Frontiers
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: Brand New. 2012 edition. 620 pages. 9.00x6.10x1.30 inches. In Stock. Codice articolo 3642431445
Compra nuovo
EUR 134,72
Spese di spedizione:
EUR 14,22
Da: Regno Unito a: U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Boolean Function Complexity : Advances and Frontiers
Editore:
Springer Berlin Heidelberg, 2014
ISBN 10: 3642431445
ISBN 13: 9783642431449
Nuovo
Taschenbuch
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. 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 9783642431449
Compra nuovo
EUR 85,59
Spese di spedizione:
EUR 64,75
Da: Germania a: U.S.A.
Quantità: 1 disponibili