Imagen de Google Jackets

Boolean Function Complexity [electronic resource] : Advances and Frontiers / by Stasys Jukna.

Por: Tipo de material: TextoTextoSeries Algorithms and Combinatorics ; 27 | Algorithms and Combinatorics ; 27Editor: Berlin, Heidelberg : Springer Berlin Heidelberg, 2012Descripción: XVI, 620 p. online resourceTipo de contenido:
  • text
Tipo de medio:
  • computer
Tipo de soporte:
  • online resource
ISBN:
  • 9783642245084
Trabajos contenidos:
  • SpringerLink (Online service)
Tema(s): Formatos físicos adicionales: Sin títuloClasificación CDD:
  • 519 23
Clasificación LoC:
  • Q350-390
  • QA10.4
Recursos en línea:
Contenidos:
Springer eBooksResumen: 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.
Etiquetas de esta biblioteca: No hay etiquetas de esta biblioteca para este título. Ingresar para agregar etiquetas.
Valoración
    Valoración media: 0.0 (0 votos)
No hay ítems correspondientes a este registro

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.

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.

ZDB-2-SMA

No hay comentarios en este titulo.

para colocar un comentario.