Boolean Function Complexity pdf epub mobi txt 電子書下載 2024

☆☆☆☆☆
簡體網頁||繁體網頁

Paterson, M.S. 編

1992-11

212

$ 63.28

9780521408264

圖書標籤:

喜歡 Boolean Function Complexity 的讀者還喜歡

下載链接在页面底部

點擊這裡下載

facebook linkedin mastodon messenger pinterest reddit telegram twitter viber vkontakte whatsapp 複製鏈接

想要找書就要到小哈圖書下載中心

qciss.net

立刻按 ctrl+D收藏本頁

你會得到大驚喜!!

发表于2024-09-22

Boolean Function Complexity epub 下載 mobi 下載 pdf 下載 txt 電子書下載 2024

Boolean Function Complexity pdf epub mobi txt 電子書下載 2024

圖書描述

By considering the size of the logical network needed to perform a given computational task, the intrinsic difficulty of that task can be examined. Boolean function complexity, the combinatorial study of such networks, is a subject that started back in the 1950s and has today become one of the most challenging and vigorous areas of theoretical computer science. The papers in this book stem from the London Mathematical Society Symposium on Boolean Function Complexity held at Durham University in July 1990. The range of topics covered will be of interest to the newcomer to the field as well as the expert, and overall the papers are representative of the research presented at the Symposium. Anyone with an interest in Boolean Function complexity will find that this book is a necessary purchase.

Boolean Function Complexity 下載 mobi epub pdf txt 電子書