找回密碼
 To register

QQ登錄

只需一步,快速開(kāi)始

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

打印 上一主題 下一主題

Titlebook: Entropy, Search, Complexity; Imre Csiszár,Gyula O. H. Katona,Gábor Wiener Book 2007 Springer-Verlag Berlin Heidelberg 2007 algorithm.algor

[復(fù)制鏈接]
查看: 42709|回復(fù): 44
樓主
發(fā)表于 2025-3-21 16:33:18 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書(shū)目名稱Entropy, Search, Complexity
編輯Imre Csiszár,Gyula O. H. Katona,Gábor Wiener
視頻videohttp://file.papertrans.cn/312/311879/311879.mp4
叢書(shū)名稱Bolyai Society Mathematical Studies
圖書(shū)封面Titlebook: Entropy, Search, Complexity;  Imre Csiszár,Gyula O. H. Katona,Gábor Wiener Book 2007 Springer-Verlag Berlin Heidelberg 2007 algorithm.algor
描述The present volume is a collection of survey papers in the ?elds given in the title. They summarize the latest developments in their respective areas. More than half of the papers belong to search theory which lies on the borderline of mathematics and computer science, information theory and combinatorics, respectively. The volume is slightly related to the twin conferences “Search And Communication Complexity” and “Information Theory In Mathematics” held at Balatonlelle, Hungary in 2000. These conferences led us to believe that there is a need for such a collection of papers. The paper written by Martin Aigner starts with the following relatively new search problem. Given n boolean variables as input one has to ?nd one of them whose value is in majority. The goal is to minimize the number of tests needed for this where one test is to compare two input variables for equality. The paper surveys the large set of problems and results which grew out of this one. In the traditional search model an unknown element is sought in a ?nite set, based on the information that the unknown element is or is not in some (asked) subsets. A variant is when a 0,1 function is given on the underlying se
出版日期Book 2007
關(guān)鍵詞algorithm; algorithms; calculus; coding; combinatorics; communication; complexity; computer science; data co
版次1
doihttps://doi.org/10.1007/978-3-540-32777-6
isbn_softcover978-3-642-06899-7
isbn_ebook978-3-540-32777-6Series ISSN 1217-4696 Series E-ISSN 2947-9460
issn_series 1217-4696
copyrightSpringer-Verlag Berlin Heidelberg 2007
The information of publication is updating

書(shū)目名稱Entropy, Search, Complexity影響因子(影響力)




書(shū)目名稱Entropy, Search, Complexity影響因子(影響力)學(xué)科排名




書(shū)目名稱Entropy, Search, Complexity網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱Entropy, Search, Complexity網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱Entropy, Search, Complexity被引頻次




書(shū)目名稱Entropy, Search, Complexity被引頻次學(xué)科排名




書(shū)目名稱Entropy, Search, Complexity年度引用




書(shū)目名稱Entropy, Search, Complexity年度引用學(xué)科排名




書(shū)目名稱Entropy, Search, Complexity讀者反饋




書(shū)目名稱Entropy, Search, Complexity讀者反饋學(xué)科排名




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

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒(méi)有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 21:55:26 | 只看該作者
板凳
發(fā)表于 2025-3-22 00:45:12 | 只看該作者
1217-4696 nite set, based on the information that the unknown element is or is not in some (asked) subsets. A variant is when a 0,1 function is given on the underlying se978-3-642-06899-7978-3-540-32777-6Series ISSN 1217-4696 Series E-ISSN 2947-9460
地板
發(fā)表于 2025-3-22 05:08:22 | 只看該作者
5#
發(fā)表于 2025-3-22 11:56:34 | 只看該作者
6#
發(fā)表于 2025-3-22 16:14:52 | 只看該作者
7#
發(fā)表于 2025-3-22 18:07:19 | 只看該作者
Two Colors and More,lizations and variants of the majority problem such as producing a .-majority ball, determining the color status of all balls, arbitrarily many colors, the plurality problem, and the closely related liar problem.
8#
發(fā)表于 2025-3-22 21:37:32 | 只看該作者
9#
發(fā)表于 2025-3-23 04:00:23 | 只看該作者
1217-4696 ive areas. More than half of the papers belong to search theory which lies on the borderline of mathematics and computer science, information theory and combinatorics, respectively. The volume is slightly related to the twin conferences “Search And Communication Complexity” and “Information Theory I
10#
發(fā)表于 2025-3-23 08:18:04 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-6 16:17
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
淄博市| 牡丹江市| 锦州市| 高邑县| 西城区| 蓝山县| 盐山县| 榆社县| 玉环县| 梅河口市| 九江市| 穆棱市| 洪泽县| 阿尔山市| 巨野县| 金沙县| 博白县| 宁武县| 黄石市| 临安市| 三台县| 新沂市| 察哈| 弥渡县| 安溪县| 邯郸市| 奉化市| 延寿县| 郯城县| 邵东县| 平利县| 木兰县| 邢台市| 涞水县| 三都| 浦北县| 金溪县| 济宁市| 广东省| 文安县| 定结县|