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-08-02

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 电子书