Boolean function complexity : Advances and frontiers
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 ha...
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Libro |
| Lenguaje: | Undetermined |
| Publicado: |
Berlin
Springer
2012
|
| Materias: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Thư viện lưu trữ: | Trung tâm Học liệu Trường Đại học Cần Thơ |
|---|