
Boolean function complexity : : Advances and frontiers / Stasys Jukna
Tác giả : Stasys Jukna
Nhà xuất bản : Springer
Năm xuất bản : 2012
Nơi xuất bản : Berlin
Mô tả vật lý : xv, 615 p. : ill. ; 24 cm
ISBN : 9783642245077
Số phân loại : 511.352
Tùng thư :
Algorithms and combinatorics
Chủ đề : 1. Khoa học máy tính -- Toán học. 2. Computer science -- Mathematics. 3. Lý thuyết tính toán.
Thông tin chi tiết
Tóm tắt : | 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. |
Thông tin dữ liệu nguồn
Thư viện | Ký hiệu xếp giá | Dữ liệu nguồn |
---|---|---|
![]() |
|
https://lrcopac.ctu.edu.vn/pages/opac/wpid-detailbib-id-183639.html |