2012, ISBN: 9783642245077
Autor Stasys Jukna. Format Gebundene Ausgabe. Boolean circuit complexity is the combinatorics of computer science and involves many intriguing problems that are easy to state and explain,… Mehr…
| ebay.de frankfurt-rack 100.0, Zahlungsarten: Paypal, APPLE_PAY, Google Pay, Visa, Mastercard, American Express. Versandkosten:Versand zum Fixpreis, [SHT: Standardversand], 60*** Frankfurt, [TO: Deutschland] (EUR 4.50) Details... |
Boolean Function Complexity: Advances and Frontiers (Algorithms and Combinatorics, 27, Band 27) - gebunden oder broschiert
2012, ISBN: 9783642245077
Springer, Gebundene Ausgabe, Auflage: 2012, 636 Seiten, Publiziert: 2012-01-06T00:00:01Z, Produktgruppe: Buch, Hersteller-Nr.: biography, 2.45 kg, Verkaufsrang: 2915811, Informatik, IT-Au… Mehr…
| Amazon.de (Intern... Versandkosten:Die angegebenen Versandkosten können von den tatsächlichen Kosten abweichen. (EUR 3.00) Details... |
2012, ISBN: 9783642245077
Autor Stasys Jukna. Format Gebundene Ausgabe. Boolean circuit complexity is the combinatorics of computer science and involves many intriguing problems that are easy to state and explain,… Mehr…
| ebay.de frankfurt-rack Versandkosten:Versand zum Fixpreis, [SHT: Standardversand], 60*** Frankfurt, [TO: Deutschland] (EUR 4.50) Details... |
Boolean Function Complexity: Advances and Frontiers (Algorithms and Combinatorics, Vol. 27) - gebunden oder broschiert
2012, ISBN: 3642245072
[EAN: 9783642245077], Gebraucht, guter Zustand, [PU: Springer], Book is in Used-Good condition. Pages and cover are clean and intact. Used items may not include supplementary materials su… Mehr…
| AbeBooks.de GF Books, Inc., Hawthorne, CA, U.S.A. [64674448] [Rating: 5 (von 5)] NOT NEW BOOK. Versandkosten: EUR 18.52 Details... |
Boolean Function Complexity: Advances and Frontiers (Algorithms and Combinatorics, Vol. 27) - gebunden oder broschiert
2012, ISBN: 3642245072
[EAN: 9783642245077], Gebraucht, wie neu, [PU: Springer], Like New, Books
| AbeBooks.de Mispah books, Redhill, SURRE, United Kingdom [82663586] [Rating: 4 (von 5)] NOT NEW BOOK. Versandkosten: EUR 23.39 Details... |
2012, ISBN: 9783642245077
Autor Stasys Jukna. Format Gebundene Ausgabe. Boolean circuit complexity is the combinatorics of computer science and involves many intriguing problems that are easy to state and explain,… Mehr…
Jukna, Stasys:
Boolean Function Complexity: Advances and Frontiers (Algorithms and Combinatorics, 27, Band 27) - gebunden oder broschiert2012, ISBN: 9783642245077
Springer, Gebundene Ausgabe, Auflage: 2012, 636 Seiten, Publiziert: 2012-01-06T00:00:01Z, Produktgruppe: Buch, Hersteller-Nr.: biography, 2.45 kg, Verkaufsrang: 2915811, Informatik, IT-Au… Mehr…
2012
ISBN: 9783642245077
Autor Stasys Jukna. Format Gebundene Ausgabe. Boolean circuit complexity is the combinatorics of computer science and involves many intriguing problems that are easy to state and explain,… Mehr…
Boolean Function Complexity: Advances and Frontiers (Algorithms and Combinatorics, Vol. 27) - gebunden oder broschiert
2012, ISBN: 3642245072
[EAN: 9783642245077], Gebraucht, guter Zustand, [PU: Springer], Book is in Used-Good condition. Pages and cover are clean and intact. Used items may not include supplementary materials su… Mehr…
Boolean Function Complexity: Advances and Frontiers (Algorithms and Combinatorics, Vol. 27) - gebunden oder broschiert
2012, ISBN: 3642245072
[EAN: 9783642245077], Gebraucht, wie neu, [PU: Springer], Like New, Books
Bibliographische Daten des bestpassenden Buches
| Autor: | |
| Titel: | |
| ISBN-Nummer: |
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 mathemati
Detailangaben zum Buch - Boolean Function Complexity: Advances and Frontiers (Algorithms and Combinatorics, 27, Band 27)
EAN (ISBN-13): 9783642245077
ISBN (ISBN-10): 3642245072
Gebundene Ausgabe
Erscheinungsjahr: 2012
Herausgeber: Springer
617 Seiten
Gewicht: 1,067 kg
Sprache: Englisch
Buch in der Datenbank seit 2009-03-25T03:40:48+01:00 (Berlin)
Detailseite zuletzt geändert am 2023-10-07T01:44:38+02:00 (Berlin)
ISBN/EAN: 9783642245077
ISBN - alternative Schreibweisen:
3-642-24507-2, 978-3-642-24507-7
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: stasys, sta, twain mark, staß, jukna
Titel des Buches: the complexity boolean functions, ein yankee aus conneticut, combinatorics first course, complexity algorithms, frontiers complexity, boolean function complexity
Daten vom Verlag:
Autor/in: Stasys Jukna
Titel: Algorithms and Combinatorics; Boolean Function Complexity - Advances and Frontiers
Verlag: Springer; Springer Berlin
620 Seiten
Erscheinungsjahr: 2012-01-06
Berlin; Heidelberg; DE
Gedruckt / Hergestellt in Niederlande.
Sprache: Englisch
117,69 € (DE)
120,99 € (AT)
130,00 CHF (CH)
POD
XVI, 620 p.
BB; Hardcover, Softcover / Mathematik/Sonstiges; Theoretische Informatik; Verstehen; Boolean functions; circuit complexity; communication complexity; lower bounds; information and communication, circuits; combinatorics; Mathematical Applications in Computer Science; Theory of Computation; Discrete Mathematics; Mathematics of Computing; Diskrete Mathematik; Mathematik für Informatiker; BC
Part I Basics.- Part II Communication Complexity.- Part III Circuit Complexity.- Part IV Bounded Depth Circuits.- Part V Branching Programs.- Part VI Fragments of Proof Complexity.- A Epilog.- B Mathematical Background.- References.- Index.This is the first book covering the happening in circuit complexity during the last 20 years Includes non-standard topics, like graph complexity or circuits with arbitrary gates Includes about 40 open problems as potential research topics for students ? Includes supplementary material: sn.pub/extras
Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:
Neuestes ähnliches Buch:
9783642245091 Boolean Function Complexity: Advances and Frontiers (Jukna, Stasys)
- 9783642245091 Boolean Function Complexity: Advances and Frontiers (Jukna, Stasys)
- 9783642431449 Boolean Function Complexity: Advances and Frontiers: 27 (Algorithms and Combinatorics, 27) (Jukna, Stasys)
- 9783642245084 Boolean Function Complexity (Stasys Jukna)
- 9780521408264 Boolean Function Complexity (Hitchin, N. J. (Herausgeber); Paterson, M. S. (Herausgeber))
< zum Archiv...