Boolean Function Complexity: Advances and Frontiers: 27 (Algorithms and Combinatorics) - Tapa blanda

Jukna, Stasys

9783642431449: Boolean Function Complexity: Advances and Frontiers: 27 (Algorithms and Combinatorics)

Tapa blanda

ISBN 10: 3642431445 ISBN 13: 9783642431449

Editorial: Springer, 2014

Ver todas las copias de esta edici�n del ISBN

1 Usado

De EUR 137,79

9 Nuevo

De EUR 72,89

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.

Editorial: Springer
A�o de publicaci�n: 2014
Idioma: Ingl�s
ISBN 10: 3642431445
ISBN 13: 9783642431449
Encuadernaci�n: Tapa blanda
N�mero de p�ginas: 636
Contacto del fabricante: no disponible
Persona responsable: CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Alemania

Comprar usado

Condici�n: Como Nuevo

Like New

Ver este art�culo

EUR 137,79

Convertir moneda

EUR 28,83 gastos de env�o desde Reino Unido a Espa�a

Destinos, gastos y plazos de env�o

A�adir al carrito

Comprar nuevo

Ver este art�culo

EUR 72,89

Convertir moneda

EUR 19,49 gastos de env�o desde Alemania a Espa�a

Destinos, gastos y plazos de env�o

A�adir al carrito

Otras ediciones populares con el mismo t�tulo

9783642245077: Boolean Function Complexity: Advances and Frontiers: 27 (Algorithms and Combinatorics)

Edici�n Destacada

ISBN 10: 3642245072 ISBN 13: 9783642245077
Editorial: Springer, 2012
Tapa dura

Resultados de la b�squeda para Boolean Function Complexity: Advances and Frontiers:...

Imagen del vendedor

Boolean Function Complexity

Stasys Jukna

Publicado por Springer Berlin Heidelberg, 2014

ISBN 10: 3642431445 ISBN 13: 9783642431449

Nuevo Tapa blanda

Impresi�n bajo demanda

Librería: moluna, Greven, Alemania

Calificaci�n del vendedor: 5 de 5 estrellas

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: 5060606

Contactar al vendedor

Comprar nuevo

EUR 72,89

Convertir moneda

Gastos de env�o: EUR 19,49

De Alemania a Espa�a

Destinos, gastos y plazos de env�o

Cantidad disponible: M�s de 20 disponibles

A�adir al carrito

Imagen del vendedor

Boolean Function Complexity

Stasys Jukna

Publicado por Springer Berlin Heidelberg Feb 2014, 2014

ISBN 10: 3642431445 ISBN 13: 9783642431449

Nuevo Taschenbuch

Impresi�n bajo demanda

Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania

Calificaci�n del vendedor: 5 de 5 estrellas

Taschenbuch. 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: 9783642431449

Contactar al vendedor

Comprar nuevo

EUR 85,59

Convertir moneda

Gastos de env�o: EUR 11,00

De Alemania a Espa�a

Destinos, gastos y plazos de env�o

Cantidad disponible: 2 disponibles

A�adir al carrito

Imagen del vendedor

Boolean Function Complexity : Advances and Frontiers

Stasys Jukna

Publicado por Springer Berlin Heidelberg, 2014

ISBN 10: 3642431445 ISBN 13: 9783642431449

Nuevo Taschenbuch

Librería: AHA-BUCH GmbH, Einbeck, Alemania

Calificaci�n del vendedor: 5 de 5 estrellas

Taschenbuch. 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: 9783642431449

Contactar al vendedor

Comprar nuevo

EUR 85,59

Convertir moneda

Gastos de env�o: EUR 11,99

De Alemania a Espa�a

Destinos, gastos y plazos de env�o

Cantidad disponible: 1 disponibles

A�adir al carrito

Imagen de archivo

Jukna:Boolean Function Complexity (eng)

Jukna, Stasys

Publicado por Springer, 2014

ISBN 10: 3642431445 ISBN 13: 9783642431449

Nuevo Tapa blanda

Impresi�n bajo demanda

Librería: Brook Bookstore On Demand, Napoli, NA, Italia

Calificaci�n del vendedor: 4 de 5 estrellas

Condici�n: new. Questo � un articolo print on demand. N� de ref. del art�culo: f6a8568e618855bf020fc4681330e15e

Contactar al vendedor

Comprar nuevo

EUR 70,24

Convertir moneda

Gastos de env�o: EUR 40,00

De Italia a Espa�a

Destinos, gastos y plazos de env�o

Cantidad disponible: M�s de 20 disponibles

A�adir al carrito

Imagen del vendedor

Boolean Function Complexity

Stasys Jukna

Publicado por Springer Berlin Heidelberg, Springer Berlin Heidelberg Feb 2014, 2014

ISBN 10: 3642431445 ISBN 13: 9783642431449

Nuevo Taschenbuch

Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania

Calificaci�n del vendedor: 5 de 5 estrellas

Taschenbuch. 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: 9783642431449

Contactar al vendedor