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...

Disgrifiad llawn

Wedi'i Gadw mewn:
Manylion Llyfryddiaeth
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