找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
查看: 42667|回复: 44
发表于 2025-3-21 16:33:18 | 显示全部楼层 |阅读模式
书目名称Entropy, Search, Complexity
编辑Imre Csiszár,Gyula O. H. Katona,Gábor Wiener
视频video
丛书名称Bolyai Society Mathematical Studies
图书封面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
关键词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

书目名称Entropy, Search, Complexity影响因子(影响力)




书目名称Entropy, Search, Complexity影响因子(影响力)学科排名




书目名称Entropy, Search, Complexity网络公开度




书目名称Entropy, Search, Complexity网络公开度学科排名




书目名称Entropy, Search, Complexity被引频次




书目名称Entropy, Search, Complexity被引频次学科排名




书目名称Entropy, Search, Complexity年度引用




书目名称Entropy, Search, Complexity年度引用学科排名




书目名称Entropy, Search, Complexity读者反馈




书目名称Entropy, Search, Complexity读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 21:55:26 | 显示全部楼层
发表于 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
发表于 2025-3-22 05:08:22 | 显示全部楼层
发表于 2025-3-22 11:56:34 | 显示全部楼层
发表于 2025-3-22 16:14:52 | 显示全部楼层
发表于 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.
发表于 2025-3-22 21:37:32 | 显示全部楼层
发表于 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
发表于 2025-3-23 08:18:04 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-10 13:36
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表