90折
Boolean Function Complexity
商品資訊
系列名：Algorithms and Combinatorics
ISBN13：9783642245077
替代書名：Boolean Function Complexity
出版社：Springer-Verlag New York Inc
作者：Stasys Jukna
出版日：2012/01/05
裝訂／頁數：精裝／617頁
規格：23.5cm*15.2cm*3.8cm (高/寬/厚)
版次：1
定價
：NT$ 4250 元優惠價
：
90 折 3825 元
若需訂購本書，請電洽客服 02-25006600[分機130、131]。
商品簡介
作者簡介
商品簡介
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.
作者簡介
http://www.thi.informatik.uni-frankfurt.de/~jukna/
購物須知
外文書商品之書封，為出版社提供之樣本。實際出貨商品，以出版社所提供之現有版本為主。部份書籍，因出版社供應狀況特殊，匯率將依實際狀況做調整。
無庫存之商品，在您完成訂單程序之後，將以空運的方式為你下單調貨。為了縮短等待的時間，建議您將外文書與其他商品分開下單，以獲得最快的取貨速度，平均調貨時間為1~2個月。
為了保護您的權益，「三民網路書店」提供會員七日商品鑑賞期(收到商品為起始日)。
若要辦理退貨，請在商品鑑賞期內寄回，且商品必須是全新狀態與完整包裝(商品、附件、發票、隨貨贈品等)否則恕不接受退貨。