SKU/Artículo: AMZ-3642431445

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

Format:

Paperback

Hardcover

Paperback

eTextbook

Detalles del producto
Disponibilidad:
En stock
Peso con empaque:
1.14 kg
Devolución:
Condición
Nuevo
Producto de:
Amazon
Viaja desde
USA

Sobre este producto
  • 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.
U$S 224,98
60% OFF
U$S 89,99

IMPORTÁ FACIL

Comprando este producto podrás descontar el IVA con tu número de RUT

NO CONSUME FRANQUICIA

Si tu carrito tiene solo libros o CD’s, no consume franquicia y podés comprar hasta U$S 1000 al año.

U$S 224,98
60% OFF
U$S 89,99

¡Comprá en hasta 12 cuotas sin interés con todas tus tarjetas!

Llega en 5 a 11 días hábiles
con envío
Tienes garantía de entrega