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...
Wedi'i Gadw mewn:
| Prif Awdur: | Jukna, Stasys |
|---|---|
| Fformat: | Llyfr |
| Iaith: | Undetermined |
| Cyhoeddwyd: |
Berlin
Springer
2012
|
| Pynciau: | |
| Tagiau: |
Ychwanegu Tag
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!
|
| Thư viện lưu trữ: | Trung tâm Học liệu Trường Đại học Cần Thơ |
|---|
Eitemau Tebyg
-
The complexity of Boolean functions
gan: Wegener, Ingor
Cyhoeddwyd: (2010) -
Dynamics of Complex Autonomous Boolean Networks
gan: Rosin, David P
Cyhoeddwyd: (2015) -
Boolean Representations of Simplicial Complexes and Matroids
gan: Rhodes, John, et al.
Cyhoeddwyd: (2015) -
Optimization techniques for solving complex problems
Cyhoeddwyd: (2009) -
Boolean Functions in Cryptology and
Information Security
gan: Preneel, Bart, et al.
Cyhoeddwyd: (2013)