2008 23rd Annual IEEE Conference on Computational Complexity最新文献

Noisy Interpolating Sets for Low Degree Polynomials 低次多项式的噪声插值集

2008 23rd Annual IEEE Conference on Computational Complexity Pub Date : 2008-06-22 DOI: 10.4086/toc.2011.v007a001

Zeev Dvir, Amir Shpilka

引用次数: 9

Amplifying ZPP^SAT[1] and the Two Queries Problem 放大ZPP^SAT[1]与双查询问题

2008 23rd Annual IEEE Conference on Computational Complexity Pub Date : 2008-06-22 DOI: 10.1109/CCC.2008.32

Richard Chang, Suresh Purini

引用次数: 6

Approximation of Natural W[P]-Complete Minimisation Problems Is Hard 自然W[P]-完全极小化问题的逼近性

2008 23rd Annual IEEE Conference on Computational Complexity Pub Date : 2008-06-22 DOI: 10.1109/CCC.2008.24

Kord Eickmeyer, Martin Grohe, M. Grüber

引用次数: 22

Learning Complexity vs. Communication Complexity 学习复杂性vs.沟通复杂性

2008 23rd Annual IEEE Conference on Computational Complexity Pub Date : 2008-06-22 DOI: 10.1017/S0963548308009656

N. Linial, A. Shraibman

{"title":"Learning Complexity vs. Communication Complexity","authors":"N. Linial, A. Shraibman","doi":"10.1017/S0963548308009656","DOIUrl":"https://doi.org/10.1017/S0963548308009656","url":null,"abstract":"This paper has two main focal points. We first consider an important class of machine learning algorithms - large margin classifiers, such as support vector machines. The notion of margin complexity quantifies the extent to which a given class of functions can be learned by large margin classifiers. We prove that up to a small multiplicative constant, margin complexity is equal to the inverse of discrepancy. This establishes a strong tie between seemingly very different notions from two distinct areas. In the same way that matrix rigidity is related to rank, we introduce the notion of rigidity of margin complexity. We prove that sign matrices with small margin complexity rigidity are very rare. This leads to the question of proving lower bounds on the rigidity of margin complexity. Quite surprisingly, this question turns out to be closely related to basic open problems in communication complexity, e.g., whether PSPACE can be separated from the polynomial hierarchy in communication complexity. There are numerous known relations between the field of learning theory and that of communication complexity, as one might expect since communication is an inherent aspect of learning. The results of this paper constitute another link in this rich web of relations. This link has already proved significant as it was used in the solution of a few open problems in communication complexity.","PeriodicalId":338061,"journal":{"name":"2008 23rd Annual IEEE Conference on Computational Complexity","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127567210","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}

引用次数: 72

Constraint Logic: A Uniform Framework for Modeling Computation as Games 约束逻辑:将计算建模为游戏的统一框架

2008 23rd Annual IEEE Conference on Computational Complexity Pub Date : 2008-06-22 DOI: 10.1109/CCC.2008.35

E. Demaine, R. Hearn

{"title":"Constraint Logic: A Uniform Framework for Modeling Computation as Games","authors":"E. Demaine, R. Hearn","doi":"10.1109/CCC.2008.35","DOIUrl":"https://doi.org/10.1109/CCC.2008.35","url":null,"abstract":"We introduce a simple game family, called constraint logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be interpreted in many different game-theoretic settings, ranging from zero-player automata to a more economic setting of team multiplayer games with hidden information. Each setting gives rise to a model of computation that we show corresponds to a classic complexity class. In this way we obtain a uniform framework for modeling various complexities of computation as games. Most surprising among our results is that a game with three players and a bounded amount of state can simulate any (infinite) Turing computation, making the game undecidable. Our framework also provides a more graphical, less formulaic viewpoint of computation. This graph model has been shown to be particularly appropriate for reducing to many existing combinatorial games and puzzles - such as Sokoban, rush hour, river crossing, tipover, the warehouseman's problem, pushing blocks, hinged-dissection reconfiguration, Amazons, and Konane (hawaiian checkers) - which have an intrinsically planar structure. Our framework makes it substantially easier to prove completeness of such games in their appropriate complexity classes.","PeriodicalId":338061,"journal":{"name":"2008 23rd Annual IEEE Conference on Computational Complexity","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134189514","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}

引用次数: 34

A Direct Product Theorem for Discrepancy 差的直积定理

2008 23rd Annual IEEE Conference on Computational Complexity Pub Date : 2008-06-22 DOI: 10.1109/CCC.2008.25

Troy Lee, A. Shraibman, R. Spalek

引用次数: 92

On the Relative Efficiency of Resolution-Like Proofs and Ordered Binary Decision Diagram Proofs 类分辨率证明与有序二元决策图证明的相对效率

2008 23rd Annual IEEE Conference on Computational Complexity Pub Date : 2008-06-22 DOI: 10.1109/CCC.2008.34

Nathan Segerlind

引用次数: 15

Randomised Individual Communication Complexity 随机个体通信复杂性

2008 23rd Annual IEEE Conference on Computational Complexity Pub Date : 2008-06-22 DOI: 10.1109/CCC.2008.33

H. Buhrman, M. Koucký, N. Vereshchagin

引用次数: 10

Amplifying Lower Bounds by Means of Self-Reducibility 利用自约性放大下界

2008 23rd Annual IEEE Conference on Computational Complexity Pub Date : 2008-06-22 DOI: 10.1145/1706591.1706594

E. Allender, M. Koucký

{"title":"Amplifying Lower Bounds by Means of Self-Reducibility","authors":"E. Allender, M. Koucký","doi":"10.1145/1706591.1706594","DOIUrl":"https://doi.org/10.1145/1706591.1706594","url":null,"abstract":"We observe that many important computational problems in NC1 share a simple self-reducibility property. We then show that, for any problem A having this self-reducibility property, A has polynomial size TC0 circuits if and only if it has TC0 circuits of size n1+isin for every isin>0 (counting the number of wires in a circuit as the size of the circuit). As an example of what this observation yields, consider the Boolean formula evaluation problem (BFE), which is complete for NC1. It follows from a lower bound of Impagliazzo, Paturi, and Saks, that BFE requires depth d TC0 circuits of size n1+isin d. If one were able to improve this lower bound to show that there is some constant isin>0 such that every TC0 circuit family recognizing BFE has size n1+isin, then it would follow that TC0neNC1. We also show that problems with small uniform constant- depth circuits have algorithms that simultaneously have small space and time bounds. We then make use of known time-space tradeoff lower bounds to show that SAT requires uniform depth d TC0 and AC0 [6] circuits of size n1+c for some constant c depending on d.","PeriodicalId":338061,"journal":{"name":"2008 23rd Annual IEEE Conference on Computational Complexity","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116048549","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}

引用次数: 88

Quantum Expanders: Motivation and Constructions 量子扩展器:动机和结构

2008 23rd Annual IEEE Conference on Computational Complexity Pub Date : 2008-06-22 DOI: 10.1109/CCC.2008.23

Avraham Ben-Aroya, O. Schwartz, A. Ta-Shma

引用次数: 18