Boolean Function Complexity 2024 pdf epub mobi 电子书

☆☆☆☆☆
简体网页||繁体网页

Boolean Function Complexity 2024 pdf epub mobi 电子书著者简介

Boolean Function Complexity 电子书图书目录

下载链接在页面底部

点击这里下载

facebook linkedin mastodon messenger pinterest reddit telegram twitter viber vkontakte whatsapp 复制链接

想要找书就要到本本书屋

onlinetoolsland.com

立刻按 ctrl+D收藏本页

你会得到大惊喜!!

发表于2024-12-19

Boolean Function Complexity 2024 pdf epub mobi 电子书

喜欢 Boolean Function Complexity 电子书的读者还喜欢

Boolean Function Complexity 电子书读后感

评分☆☆☆☆☆

类似图书点击查看全场最低价

出版者:

作者:Paterson, M.S. 编

出品人:

页数:212

译者:

出版时间:1992-11

价格:$ 63.28

装帧:

isbn号码:9780521408264

丛书系列:

图书标签:

Boolean Function Complexity 2024 pdf epub mobi 电子书图书描述

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 2024 pdf epub mobi 电子书

想要找书就要到本本书屋

onlinetoolsland.com

立刻按 ctrl+D收藏本页

你会得到大惊喜!!