arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1007.1841cs.CC
收藏

通信复杂性

Communication Complexity

Dömötör Pálvölgyi

摘要:

第一部分从基本定义开始,主要是遵循E。Kushilevitz和N.尼桑在第一部分的结尾,我将研究树平衡。在第二节中,我总结了著名的下界方法,并证明了某些函数的精确复杂性。第三节的第一部分介绍了随机复杂度的概念,并证明了随机复杂度的基本引理,第二部分证明了随机函数复杂度的一个较好的下界。在第三部分中,我介绍并比较了几个上界的单位函数的复杂性。在第四节中,我研究了著名的直和猜想。我介绍了一个不同的计算模型,然后证明它是相同的,因为原来的一个常数的因素。这个新的模型被用来限制一个函数的摊销时间复杂度,由它的协议树的叶子的数量。在此之后,我研究了部分信息和随机情况下的直和问题。在最后一节中,我介绍了著名的层次类,约简和函数序列的完备性。然后在通信复杂性模型中定义了PSPACE类和Oracle类,并证明了它们的一些基本性质。

英文摘要:

The first section starts with the basic definitions following mainly the notations of the book written by E. Kushilevitz and N. Nisan. At the end of the first section I examine tree-balancing. In the second section I summarize the well-known lower bound methods and prove the exact complexity of certain functions. In the first part of the third section I introduce the random complexity and prove the basic lemmas about it. In the second part I prove a better lower bound for the complexity of all random functions. In the third part I introduce and compare several upper bounds for the complexity of the identity function. In the fourth section I examine the well-known Direct-sum conjecture. I introduce a different model of computation then prove that it is the same as the original one up to a constant factor. This new model is used to bound the Amortized Time Complexity of a function by the number of the leaves of its protocol-tree. After this I examine the Direct-sum problem in case of Partial Information and in the Random case. In the last section I introduce the well-known hierarchy classes, the reducibility and the completeness of series of functions. Then I define the class PSPACE and Oracles in the communication complexity model and prove some basic claims about them.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑