18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.最新文献_第3页

A combinatorial characterization of resolution width 分辨率宽度的组合表征

18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings. Pub Date : 2003-07-07 DOI: 10.1109/CCC.2003.1214424

Albert Atserias, V. Dalmau

引用次数: 169

Disjoint NP-pairs 不相交的NP-pairs

18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings. Pub Date : 2003-07-07 DOI: 10.1109/CCC.2003.1214430

Christian Glaßer, A. Selman, Samik Sengupta, Liyu Zhang

引用次数: 54

Inapproximability - some history and some open problems 不可接近性-一些历史和一些开放的问题

18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings. Pub Date : 2003-07-07 DOI: 10.1109/CCC.2003.1214426

J. Håstad

引用次数: 3

Universal languages and the power of diagonalization 通用语言和对角化的力量

18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings. Pub Date : 2003-07-07 DOI: 10.1109/CCC.2003.1214432

Alan Nash, R. Impagliazzo, J. Remmel

引用次数: 4

Extracting the mutual information for a triple of binary strings 提取二进制字符串三元组的互信息

18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings. Pub Date : 2003-07-07 DOI: 10.1109/CCC.2003.1214422

Andrei E. Romashchenko

引用次数: 14

Extremal properties of polynomial threshold functions 多项式阈值函数的极值性质

18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings. Pub Date : 2003-07-07 DOI: 10.1109/CCC.2003.1214406

R. O'Donnell, R. Servedio

引用次数: 49

Parameterized complexity for the skeptic 怀疑论者的参数化复杂性

18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings. Pub Date : 2003-07-07 DOI: 10.1109/CCC.2003.1214417

Rodney G. Downey

引用次数: 83

Quantum certificate complexity 量子证书复杂度

18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings. Pub Date : 2002-10-02 DOI: 10.1109/CCC.2003.1214418

S. Aaronson

引用次数: 48

Rectangle size bounds and threshold covers in communication complexity 通信复杂度中的矩形大小边界和阈值覆盖

18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings. Pub Date : 2002-08-05 DOI: 10.1109/CCC.2003.1214415

H. Klauck

{"title":"Rectangle size bounds and threshold covers in communication complexity","authors":"H. Klauck","doi":"10.1109/CCC.2003.1214415","DOIUrl":"https://doi.org/10.1109/CCC.2003.1214415","url":null,"abstract":"We investigate the power of the most important lower bound technique in randomized communication complexity, which is based on an evaluation of the maximal size of approximately monochromatic rectangles, with respect to arbitrary distributions on the inputs. While it is known that the 0-error version of this bound is polynomially tight for deterministic communication, nothing in this direction is known for constant error and randomized communication complexity. We first study a one-sided version of this bound and obtain that its value lies between the MA- and AM- complexities of the considered function. Hence the lower bound actually works for a (communication) complexity class between MA/spl cap/co - MA and AM/spl cap/co - AM, and allows to show that the MA-complexity of the disjointness problem is /spl Omega/(/spl radic/n). Following this we consider the conjecture that the lower bound method is polynomially tight for randomized communication complexity. First we disprove a distributional version of this conjecture. Then we give a combinatorial characterization of the value of the lower bound method, in which the optimization over all distributions is absent. This characterization is done by what we call a bounded error uniform threshold cover, and reduces showing tightness of the bound to the construction of an efficient protocol for a specific communication problem. We then study relaxations of bounded error uniform threshold covers, namely approximate majority covers and majority covers, and exhibit exponential separations between them. Each of these covers captures a lower bound method previously used for randomized communication complexity.","PeriodicalId":286846,"journal":{"name":"18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.","volume":"215 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133097106","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 78