找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Communication Complexity and Parallel Computing; Juraj Hromkovi? Textbook 1997 Springer-Verlag Berlin Heidelberg 1997 Boolean circuits.Boo

[復(fù)制鏈接]
查看: 52198|回復(fù): 35
樓主
發(fā)表于 2025-3-21 18:46:07 | 只看該作者 |倒序瀏覽 |閱讀模式
書目名稱Communication Complexity and Parallel Computing
編輯Juraj Hromkovi?
視頻videohttp://file.papertrans.cn/231/230391/230391.mp4
叢書名稱Texts in Theoretical Computer Science. An EATCS Series
圖書封面Titlebook: Communication Complexity and Parallel Computing;  Juraj Hromkovi? Textbook 1997 Springer-Verlag Berlin Heidelberg 1997 Boolean circuits.Boo
描述The communication complexity of two-party protocols is an only 15 years old complexity measure, but it is already considered to be one of the fundamen- tal complexity measures of recent complexity theory. Similarly to Kolmogorov complexity in the theory of sequential computations, communication complex- ity is used as a method for the study of the complexity of concrete computing problems in parallel information processing. Especially, it is applied to prove lower bounds that say what computer resources (time, hardware, memory size) are necessary to compute the given task. Besides the estimation of the compu- tational difficulty of computing problems the proved lower bounds are useful for proving the optimality of algorithms that are already designed. In some cases the knowledge about the communication complexity of a given problem may be even helpful in searching for efficient algorithms to this problem. The study of communication complexity becomes a well-defined indepen- dent area of complexity theory. In addition to a strong relation to several funda- mental complexity measures (and so to several fundamental problems of com- plexity theory) communication complexity has contribu
出版日期Textbook 1997
關(guān)鍵詞Boolean circuits; Boolean functions; Formale Sprachen; Heuristics; Kommunikationskomplexit?t; Parallele B
版次1
doihttps://doi.org/10.1007/978-3-662-03442-2
isbn_softcover978-3-642-08185-9
isbn_ebook978-3-662-03442-2Series ISSN 1862-4499 Series E-ISSN 1862-4502
issn_series 1862-4499
copyrightSpringer-Verlag Berlin Heidelberg 1997
The information of publication is updating

書目名稱Communication Complexity and Parallel Computing影響因子(影響力)




書目名稱Communication Complexity and Parallel Computing影響因子(影響力)學(xué)科排名




書目名稱Communication Complexity and Parallel Computing網(wǎng)絡(luò)公開度




書目名稱Communication Complexity and Parallel Computing網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Communication Complexity and Parallel Computing被引頻次




書目名稱Communication Complexity and Parallel Computing被引頻次學(xué)科排名




書目名稱Communication Complexity and Parallel Computing年度引用




書目名稱Communication Complexity and Parallel Computing年度引用學(xué)科排名




書目名稱Communication Complexity and Parallel Computing讀者反饋




書目名稱Communication Complexity and Parallel Computing讀者反饋學(xué)科排名




單選投票, 共有 1 人參與投票
 

0票 0.00%

Perfect with Aesthetics

 

1票 100.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-22 00:15:40 | 只看該作者
Textbook 1997s to this problem. The study of communication complexity becomes a well-defined indepen- dent area of complexity theory. In addition to a strong relation to several funda- mental complexity measures (and so to several fundamental problems of com- plexity theory) communication complexity has contribu
板凳
發(fā)表于 2025-3-22 00:58:19 | 只看該作者
Boolean Circuits, claiming that the circuit has to be large because of the necessary amount of information which must flow between these two circuit parts. To get a lower bound on the depth of Boolean circuits computing a specific function we need to introduce communication complexity of relations, which slightly di
地板
發(fā)表于 2025-3-22 07:18:00 | 只看該作者
5#
發(fā)表于 2025-3-22 11:04:49 | 只看該作者
6#
發(fā)表于 2025-3-22 15:40:52 | 只看該作者
Valentina Iurchenko,Elena Lebedevanputs. This contrasts to the Boolean circuits, where each processor and each directed edge were at most once active in the whole computation on an input. The main complexity measures of the VLSI circuit model are layout area A and time T (the number of working steps) . Since many computing problems
7#
發(fā)表于 2025-3-22 17:25:44 | 只看該作者
8#
發(fā)表于 2025-3-22 21:54:03 | 只看該作者
978-3-642-08185-9Springer-Verlag Berlin Heidelberg 1997
9#
發(fā)表于 2025-3-23 02:53:27 | 只看該作者
10#
發(fā)表于 2025-3-23 05:38:59 | 只看該作者
Critical Realism in the Social Sciencesis advised that this section does not give a detailed exposition (including illustrative examples of objects defined or some theorems and proofs about the defined objects) of the topics covered, but rather a setting of the notations and concepts which will be freely used throughout the book. Formal
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-14 04:21
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
南漳县| 印江| 景东| 张掖市| 克拉玛依市| 蓬溪县| 苏州市| 巢湖市| 东安县| 柘城县| 同仁县| 牙克石市| 峡江县| 锡林郭勒盟| 镇雄县| 拉孜县| 纳雍县| 萝北县| 栾城县| 阜南县| 根河市| 朝阳区| 蒲江县| 屯留县| 贞丰县| 阳原县| 高邮市| 信丰县| 布尔津县| 涟源市| 曲靖市| 图们市| 拜城县| 太湖县| 甘谷县| 吉木萨尔县| 卢湾区| 汶上县| 德阳市| 天峨县| 阆中市|