Artículos relacionados a Boolean Function Complexity: Advances and Frontiers:...
Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Acerca del autor
http://www.thi.informatik.uni-frankfurt.de/~jukna/
De la contraportada
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
EUR 89,82
EUR 23,11 gastos de envío desde Estados Unidos de America a España
Destinos, gastos y plazos de envíoComprar nuevo
Ver este artículo
EUR 98,54
EUR 19,49 gastos de envío desde Alemania a España
Destinos, gastos y plazos de envío
Resultados de la búsqueda para Boolean Function Complexity: Advances and Frontiers:...
Imagen de archivo
Boolean Function Complexity: Advances and Frontiers (Algorithms and Combinatorics, Vol. 27)
Librería: Shakespeare Book House, Rockford, IL, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: 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!! Nº de ref. del artículo: 570W2K001ZWW_ns
Cantidad disponible: 1 disponibles
Imagen del vendedor
Boolean Function Complexity
Publicado por
Springer Berlin Heidelberg, 2012
ISBN 10: 3642245072
ISBN 13: 9783642245077
Nuevo
Tapa dura
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Gebunden. Condición: 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. Nº de ref. del artículo: 5053590
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Boolean Function Complexity
Publicado por
Springer Berlin Heidelberg Jan 2012, 2012
ISBN 10: 3642245072
ISBN 13: 9783642245077
Nuevo
Tapa dura
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: 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. Nº de ref. del artículo: 9783642245077
Cantidad disponible: 2 disponibles
Imagen del vendedor
Boolean Function Complexity : Advances and Frontiers
Publicado por
Springer Berlin Heidelberg, 2012
ISBN 10: 3642245072
ISBN 13: 9783642245077
Nuevo
Tapa dura
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: 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. Nº de ref. del artículo: 9783642245077
Cantidad disponible: 1 disponibles
Imagen de archivo
Jukna:Boolean Function Complexity (eng)
Impresión bajo demandaLibrería: Brook Bookstore On Demand, Napoli, NA, Italia
Calificación del vendedor: 5 de 5 estrellas
Condición: new. Questo è un articolo print on demand. Nº de ref. del artículo: ae7c5c5a258c36e2ba3e71c4f6dbfb59
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Boolean Function Complexity
Publicado por
Springer Berlin Heidelberg, Springer Berlin Heidelberg Jan 2012, 2012
ISBN 10: 3642245072
ISBN 13: 9783642245077
Nuevo
Tapa dura
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: 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. Nº de ref. del artículo: 9783642245077
Cantidad disponible: 2 disponibles
Imagen de archivo
Boolean Function Complexity
Librería: Books Puddle, New York, NY, Estados Unidos de America
Calificación del vendedor: 4 de 5 estrellas
Condición: New. pp. 636 Index. Nº de ref. del artículo: 264333829
Cantidad disponible: 4 disponibles
Imagen de archivo
Boolean Function Complexity
Impresión bajo demandaLibrería: Majestic Books, Hounslow, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Print on Demand pp. 636 70 Illus. Nº de ref. del artículo: 3514074
Cantidad disponible: 4 disponibles
Imagen de archivo
Boolean Function Complexity
Impresión bajo demandaLibrería: Biblios, Frankfurt am main, HESSE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: New. PRINT ON DEMAND pp. 636 Epilogue. Nº de ref. del artículo: 184333839
Cantidad disponible: 4 disponibles
Imagen de archivo
Boolean Function Complexity: Advances and Frontiers (Algorithms and Combinatorics, Vol. 27)
Librería: Mispah books, Redhill, SURRE, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
Hardcover. Condición: Like New. Like New. book. Nº de ref. del artículo: ERICA79036422450726
Cantidad disponible: 1 disponibles