Verwandte Artikel zu Boolean Function Complexity: Advances and Frontiers:...
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Über die Autorin bzw. den Autor
http://www.thi.informatik.uni-frankfurt.de/~jukna/
Von der hinteren Coverseite
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Gebraucht kaufen
Zustand: AusreichendItem in acceptable condition including...
Diesen Artikel anzeigen
EUR 90,09
EUR 23,18 für den Versand von USA nach Deutschland
Versandziele, Kosten & DauerNeu kaufen
Diesen Artikel anzeigen
EUR 98,54
Gratis für den Versand innerhalb von/der Deutschland
Versandziele, Kosten & Dauer
Suchergebnisse für Boolean Function Complexity: Advances and Frontiers:...
Foto des Verkäufers
Boolean Function Complexity
Print-on-DemandAnbieter: moluna, Greven, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Gebunden. Zustand: 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. Bestandsnummer des Verkäufers 5053590
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Boolean Function Complexity: Advances and Frontiers (Algorithms and Combinatorics, Vol. 27)
Anbieter: Shakespeare Book House, Rockford, IL, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: Acceptable. Item in acceptable condition including possible liquid damage. As well answers may be filled in. May be missing DVDs, CDs, Access code, etc. 100%Money-Back Guarantee! Ship within 24 hours!! Bestandsnummer des Verkäufers 570W2K001ZWW_ns
Anzahl: 1 verfügbar
Foto des Verkäufers
Boolean Function Complexity : Advances and Frontiers
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Buch. Zustand: 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. Bestandsnummer des Verkäufers 9783642245077
Anzahl: 1 verfügbar
Foto des Verkäufers
Boolean Function Complexity
Verlag:
Springer Berlin Heidelberg Jan 2012, 2012
ISBN 10: 3642245072
ISBN 13: 9783642245077
Neu
Hardcover
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Buch. Zustand: 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. Bestandsnummer des Verkäufers 9783642245077
Anzahl: 2 verfügbar
Foto des Verkäufers
Boolean Function Complexity
ISBN 10: 3642245072
ISBN 13: 9783642245077
Neu
Hardcover
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Buch. Zustand: 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. Bestandsnummer des Verkäufers 9783642245077
Anzahl: 2 verfügbar
Beispielbild für diese ISBN
Jukna:Boolean Function Complexity (eng)
Print-on-DemandAnbieter: Brook Bookstore On Demand, Napoli, NA, Italien
Verkäuferbewertung 5 von 5 Sternen
Zustand: new. Questo è un articolo print on demand. Bestandsnummer des Verkäufers ae7c5c5a258c36e2ba3e71c4f6dbfb59
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Boolean Function Complexity
Anbieter: Books Puddle, New York, NY, USA
Verkäuferbewertung 4 von 5 Sternen
Zustand: New. pp. 636 Index. Bestandsnummer des Verkäufers 264333829
Anzahl: 4 verfügbar
Beispielbild für diese ISBN
Boolean Function Complexity
Print-on-DemandAnbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. PRINT ON DEMAND pp. 636 Epilogue. Bestandsnummer des Verkäufers 184333839
Anzahl: 4 verfügbar
Beispielbild für diese ISBN
Boolean Function Complexity
Print-on-DemandAnbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Print on Demand pp. 636 70 Illus. Bestandsnummer des Verkäufers 3514074
Anzahl: 4 verfügbar
Beispielbild für diese ISBN
Boolean Function Complexity: Advances and Frontiers (Algorithms and Combinatorics, Vol. 27)
Anbieter: Mispah books, Redhill, SURRE, Vereinigtes Königreich
Verkäuferbewertung 4 von 5 Sternen
Hardcover. Zustand: Like New. Like New. book. Bestandsnummer des Verkäufers ERICA79036422450726
Anzahl: 1 verfügbar