2012 IEEE 27th Conference on Computational Complexity最新文献

筛选
英文 中文
Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs 曲面嵌入图可达性的空间高效算法
2012 IEEE 27th Conference on Computational Complexity Pub Date : 2012-06-26 DOI: 10.1109/CCC.2012.15
Derrick Stolee, N. V. Vinodchandran
{"title":"Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs","authors":"Derrick Stolee, N. V. Vinodchandran","doi":"10.1109/CCC.2012.15","DOIUrl":"https://doi.org/10.1109/CCC.2012.15","url":null,"abstract":"This work presents a log-space reduction which compresses an n-vertex directed acyclic graph with m(n) sources embedded on a surface of genus g(n), to a graph with O(m(n) + g(n)) vertices while preserving reachability between a given pair of vertices. Applying existing algorithms to this reduced graph yields new deterministic algorithms with improved space bounds as well as improved simultaneous timespace bounds for the reachability problem over a large class of directed acyclic graphs. Specifically, it significantly extends the class of surface-embedded graphs with log-space reachability algorithms: from planar graphs with O(log n) sources, to graphs with 2O(√log n) sources embedded on a surface of genus 2O(√log n). Additionally, it yields an O(n1-ϵ) space algorithm with polynomial running time for reachability over graphs with O(n1-ϵ) sources embedded on surfaces of genus O(n1-ϵ).","PeriodicalId":303458,"journal":{"name":"2012 IEEE 27th Conference on Computational Complexity","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128267457","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}
引用次数: 14
Matrix Isomorphism of Matrix Lie Algebras 矩阵李代数的矩阵同构
2012 IEEE 27th Conference on Computational Complexity Pub Date : 2012-06-26 DOI: 10.1109/CCC.2012.34
Joshua A. Grochow
{"title":"Matrix Isomorphism of Matrix Lie Algebras","authors":"Joshua A. Grochow","doi":"10.1109/CCC.2012.34","DOIUrl":"https://doi.org/10.1109/CCC.2012.34","url":null,"abstract":"We study the problem of matrix isomorphism of matrix Lie algebras (MatIsoLie). Lie algebras arise centrally in areas as diverse as differential equations, particle physics, group theory, and the Mulmuley -- Sohoni Geometric Complexity Theory program. A matrix Lie algebra is a set L of matrices that is closed under linear combinations and the operation [A, B] = AB - BA. Two matrix Lie algebras L, L' are matrix isomorphic if there is an invertible matrix M such that conjugating every matrix in L by M yields the set L'. We show that certain cases of MatIsoLie -- for the wide and widely studied classes of semi simple and abelian Lie algebras -- are equivalent to graph isomorphism and linear code equivalence, respectively. On the other hand, we give polynomial-time algorithms for other cases of MatIsoLie, which allow us to mostly derandomize a recent result of Kayal on affine equivalence of polynomials.","PeriodicalId":303458,"journal":{"name":"2012 IEEE 27th Conference on Computational Complexity","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127732021","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}
引用次数: 11
Complexity Lower Bounds through Balanced Graph Properties 通过平衡图属性的复杂度下界
2012 IEEE 27th Conference on Computational Complexity Pub Date : 2012-06-26 DOI: 10.1109/CCC.2012.31
Guy Moshkovitz
{"title":"Complexity Lower Bounds through Balanced Graph Properties","authors":"Guy Moshkovitz","doi":"10.1109/CCC.2012.31","DOIUrl":"https://doi.org/10.1109/CCC.2012.31","url":null,"abstract":"We present a combinatorial approach for proving complexity lower bounds; we focus on the following instantiation of this approach. For a property of regular hypergraphs with m edges and an arbitrary hypergraph G with m - t edges, we may count the number of super-hypergraphs of G (i.e., hypergraphs obtained by adding t edges) satisfying the property. Suppose that we find a pair of these properties where every such G has the same number of super-hypergraphs satisfying each property. We show that in this case, we immediately obtain an explicit m/(t - 1) lower bound on the rank of tensors (which are high-dimensional matrices). Notice that if the hypergraphs are 3-uniform, this implies a lower bound of Ω(m/t) for arithmetic circuits. We also show, albeit non-explicitly, that essentially-optimal lower bounds can be obtained using this approach. Furthermore, we exemplify our approach in the t = 2 case, and prove that even in this case we can already obtain interesting lower bounds. In particular, we derive a (tight) lower bound of 3n/2 on the rank of n × n × n tensors that are naturally associated with hypergraph trees. In fact, our bound also applies to the stronger notion of border rank, for which our result essentially matches the best lower bounds known.","PeriodicalId":303458,"journal":{"name":"2012 IEEE 27th Conference on Computational Complexity","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115117681","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}
引用次数: 0
Pseudorandom Generators for Read-Once ACC^0 一次读ACC^0的伪随机生成器
2012 IEEE 27th Conference on Computational Complexity Pub Date : 2012-06-26 DOI: 10.1109/CCC.2012.37
Dmitry Gavinsky, Shachar Lovett, S. Srinivasan
{"title":"Pseudorandom Generators for Read-Once ACC^0","authors":"Dmitry Gavinsky, Shachar Lovett, S. Srinivasan","doi":"10.1109/CCC.2012.37","DOIUrl":"https://doi.org/10.1109/CCC.2012.37","url":null,"abstract":"We consider the problem of constructing pseudorandom generators for read-once circuits. We give an explicit construction of a pseudorandom generator for the class of read-once constant depth circuits with unbounded fan-in AND, OR, NOT and generalized modulo m gates, where m is an arbitrary fixed constant. The seed length of our generator is poly-logarithmic in the number of variables and the error.","PeriodicalId":303458,"journal":{"name":"2012 IEEE 27th Conference on Computational Complexity","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128339904","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}
引用次数: 6
Better Condensers and New Extractors from Parvaresh-Vardy Codes Parvaresh-Vardy代码中更好的压缩器和新的提取器
2012 IEEE 27th Conference on Computational Complexity Pub Date : 2012-06-26 DOI: 10.1109/CCC.2012.25
A. Ta-Shma, C. Umans
{"title":"Better Condensers and New Extractors from Parvaresh-Vardy Codes","authors":"A. Ta-Shma, C. Umans","doi":"10.1109/CCC.2012.25","DOIUrl":"https://doi.org/10.1109/CCC.2012.25","url":null,"abstract":"We give a new construction of condensers based on Parvaresh-Vardy codes [1]. Our condensers have entropy rate (1-α) for subconstant α (in contrast to [2] which required constant α) and suffer only sublinear entropy loss. Known extractors can be applied to the output to extract all but a subconstant fraction of the minentropy. The resulting (k, ε) extractor E : {0, 1}<sup>n</sup> × {0, 1}<sup>d</sup> → {0, 1}<sup>m</sup> has output length m = (1- α)k with α = 1/poly log(n), and seed length d = O(log n), when ε ≥ 1/2<sup>logβ</sup> n for any constant ß <; 1. Thus we achieve the same “world-record” extractor parameters as [3], with a more direct construction.","PeriodicalId":303458,"journal":{"name":"2012 IEEE 27th Conference on Computational Complexity","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114255966","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}
引用次数: 23
The Hardness of Being Private 保持隐私的艰难
2012 IEEE 27th Conference on Computational Complexity Pub Date : 2012-06-26 DOI: 10.1145/2567671
Anil Ada, A. Chattopadhyay, S. Cook, Lila Fontes, M. Koucký, T. Pitassi
{"title":"The Hardness of Being Private","authors":"Anil Ada, A. Chattopadhyay, S. Cook, Lila Fontes, M. Koucký, T. Pitassi","doi":"10.1145/2567671","DOIUrl":"https://doi.org/10.1145/2567671","url":null,"abstract":"In 1989 Kushilevitz initiated the study of information-theoretic privacy within the context of communication complexity. Unfortunately, it has been shown that most interesting functions are not privately computable. The unattainability of perfect privacy for many functions motivated the study of approximate privacy. Feigenbaum et al. define notions of worst-case as well as average-case approximate privacy, and present several interesting upper bounds, and some open problems for further study. In this paper, we obtain asymptotically tight bounds on the tradeoffs between both the worst-case and average-case approximate privacy of protocols and their communication cost for Vickrey-auctions. Further, we relate the notion of average-case approximate privacy to other measures based on information cost of protocols. This enables us to prove exponential lower bounds on the subjective approximate privacy of protocols for computing the Intersection function, independent of its communication cost. This proves a conjecture of Feigenbaum et al.","PeriodicalId":303458,"journal":{"name":"2012 IEEE 27th Conference on Computational Complexity","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127921117","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}
引用次数: 26
Approximating AC^0 by Small Height Decision Trees and a Deterministic Algorithm for #AC^0SAT 用小高度决策树逼近AC^0及AC^0SAT的确定性算法
2012 IEEE 27th Conference on Computational Complexity Pub Date : 2012-06-26 DOI: 10.1109/CCC.2012.40
P. Beame, R. Impagliazzo, S. Srinivasan
{"title":"Approximating AC^0 by Small Height Decision Trees and a Deterministic Algorithm for #AC^0SAT","authors":"P. Beame, R. Impagliazzo, S. Srinivasan","doi":"10.1109/CCC.2012.40","DOIUrl":"https://doi.org/10.1109/CCC.2012.40","url":null,"abstract":"We show how to approximate any function in AC0 by decision trees of much smaller height than its number of variables. More precisely, we show that any function in n variables computable by an unbounded fan-in circuit of AND, OR, and NOT gates that has size S and depth d can be approximated by a decision tree of height n - βn to within error exp(-βn), where β = β(S, d) = 2-O(d log4/5 S). Our proof is constructive and we use its constructivity to derive a deterministic algorithm for #AC0 SAT with multiplicative factor savings over the naive 2n S algorithm of 2-Ω(βn), when applied to any n-input AC0 circuit of size S and depth d. Indeed, in the same running time we can deterministically construct a decision tree of size at most 2n-βn that exactly computes the function given by such a circuit. Recently, Impagliazzo, Matthews, and Paturi derived an algorithm for #AC0 SAT with greater savings over the naive algorithm but their algorithm is only randomized rather than deterministic. The main technical result we prove to show the above is that for every family F of k-DNF formulas in n variables and every 1 <; C = C(n) ≤ logpoly(k) |F|, one can construct a distribution on restrictions that each set at most n/C variables such that, except with probability at most 2-n/(2O(k)Clog |T|), after application of the restriction, all formulas in F simultaneously reduce to logpoly(k) |F|-juntas where an s-junta is a function whose value depends on only s of its inputs. Previously, Ajtai showed simultaneous approximations for k-DNF formulas by juntas related to the one we show but with a dependence on exp(k) rather than poly(k), resulting in a weaker height-approximation tradeoff than ours.","PeriodicalId":303458,"journal":{"name":"2012 IEEE 27th Conference on Computational Complexity","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121652616","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}
引用次数: 39
Limitations of Lower-Bound Methods for the Wire Complexity of Boolean Operators 布尔运算符线复杂度的下界方法限制
2012 IEEE 27th Conference on Computational Complexity Pub Date : 2012-06-26 DOI: 10.1109/CCC.2012.39
Andrew Drucker
{"title":"Limitations of Lower-Bound Methods for the Wire Complexity of Boolean Operators","authors":"Andrew Drucker","doi":"10.1109/CCC.2012.39","DOIUrl":"https://doi.org/10.1109/CCC.2012.39","url":null,"abstract":"We study the circuit complexity of Boolean operators, i.e., collections of Boolean functions defined over a common input. Our focus is the well-studied model in which arbitrary Boolean functions are allowed as gates, and in which a circuit's complexity is measured by its depth and number of wires. We show sharp limitations of several existing lowerbound methods for this model. First, we study an information-theoretic lower-bound method due to Cherukhin, that yields bounds of form Ωd(n · λd-1(n)) on the number of wires needed to compute cyclic convolutions in depth d ≥ 2. This was the first improvement over the lower bounds provided by the well-known superconcentrator technique (for d = 2, 3 and for even d ≥ 4). Cherukhin's method was formalized by Jukna as a general lower-bound criterion for Boolean operators, the “Strong Multiscale Entropy” (SME) property. It seemed plausible that this property could imply significantly better lower bounds by an improved analysis. However, we show that this is not the case, by exhibiting an explicit operator with the SME property that is computable in depth d with O(n · λd-1(n)) wires, for d = 2, 3 and for even d ≥ 6. Next, we show limitations of two simpler lower-bound criteria given by Jukna: the “entropy method” for general operators, and the “pairwise-distance method” for linear operators. We show that neither method gives super-linear lower bounds for depth 3. In the process, we obtain the first known polynomial separation between the depth-2 and depth-3 wire complexities for an explicit operator. We also continue the study (initiated by Jukna) of the complexity of “representing” a linear operator by bounded-depth circuits, a weaker notion than computing the operator.","PeriodicalId":303458,"journal":{"name":"2012 IEEE 27th Conference on Computational Complexity","volume":"508 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116330598","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}
引用次数: 8
Non-malleable Extractors with Short Seeds and Applications to Privacy Amplification 短种子非延展性提取器及其在隐私放大中的应用
2012 IEEE 27th Conference on Computational Complexity Pub Date : 2012-06-26 DOI: 10.1137/130908634
Gil Cohen, R. Raz, G. Segev
{"title":"Non-malleable Extractors with Short Seeds and Applications to Privacy Amplification","authors":"Gil Cohen, R. Raz, G. Segev","doi":"10.1137/130908634","DOIUrl":"https://doi.org/10.1137/130908634","url":null,"abstract":"Motivated by the classical problem of privacy amplification, Dodis and Wichs [9] introduced the notion of a non-malleable extractor, significantly strengthening the notion of a strong extractor. A non-malleable extractor is a function nmExt : {0, 1}n × {0, 1}d → {0, 1}m that takes two inputs: a weak source W and a uniform (independent) seed S, and outputs a string nmExt(W, S) that is nearly uniform given S as well as nmExt(W, S) for any seed S' ≠ S that is determined as an arbitrary function of S. The first explicit construction of a non-malleable extractor was recently provided by Dodis, Li, Wooley and Zuckerman [7]. Their extractor works for any weak source with min-entropy rate 1/2+δ, where δ >; 0 is an arbitrary constant, and outputs up to a linear number of bits, but suffers from two drawbacks. First, the length of its seed is linear in the length of the weak source (which leads to privacy amplification protocols with high communication complexity). Second, the construction is conditional: when outputting more than a logarithmic number of bits (as required for privacy amplification protocols) its efficiency relies on a longstanding conjecture on the distribution of prime numbers. In this paper we present an unconditional construction of a non-malleable extractor with short seeds. For any integers n and d such that 2.01 · log n ≤ d ≤ n, we present an explicit construction of a non-malleable extractor nmExt: {0, 1}n × {0, 1}d → {0, 1}m, with m = Ω(d), and error exponentially small in m. The extractor works for any weak source with min-entropy rate 1/2 + δ, where δ >; 0 is an arbitrary constant. Moreover, our extractor in fact satisfies an even more general notion of non-malleability: its output nmExt(W, S) is nearly uniform given the seed S as well as the values nmExt(W, S1),..., nmExt(W, St) for several seeds S1,..., St that may be determined as an arbitrary function of S, as long as S ∉ {S1,..., St}. By instantiating the framework of Dodis and Wichs with our non-malleable extractor, we obtain the first 2-round privacy amplification protocol for min-entropy rate 1/2 + δ with asymptotically optimal entropy loss and poly-logarithmic communication complexity. This improves the previously known 2-round privacy amplification protocols: the protocol of Dodis and Wichs whose entropy loss is not asymptotically optimal, and the protocol of Dodis, Li, Wooley and Zuckerman whose communication complexity is linear.","PeriodicalId":303458,"journal":{"name":"2012 IEEE 27th Conference on Computational Complexity","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133220093","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}
引用次数: 64
Junto-Symmetric Functions, Hypergraph Isomorphism and Crunching 君对称函数,超图同构与碾压
2012 IEEE 27th Conference on Computational Complexity Pub Date : 2012-06-26 DOI: 10.1109/CCC.2012.28
S. Chakraborty, E. Fischer, David García-Soriano, A. Matsliah
{"title":"Junto-Symmetric Functions, Hypergraph Isomorphism and Crunching","authors":"S. Chakraborty, E. Fischer, David García-Soriano, A. Matsliah","doi":"10.1109/CCC.2012.28","DOIUrl":"https://doi.org/10.1109/CCC.2012.28","url":null,"abstract":"We make a step towards characterizing the boolean functions to which isomorphism can be efficiently tested. Specifically, we prove that isomorphism to any boolean function on {0, 1}n with a polynomial number of distinct permutations can be tested with a number of queries that is independent of n. We also show some partial results in the converse direction, and discuss related problems: testing isomorphism up to linear transformations, and testing isomorphism against a uniform (hyper)graph that is given in advance. Our results regarding the latter topic generalize a theorem of Fischer (SICOMP 2005), and in the process we also provide a simpler proof of his original result which avoids the use of Szemeredi's regularity lemma.","PeriodicalId":303458,"journal":{"name":"2012 IEEE 27th Conference on Computational Complexity","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129472865","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}
引用次数: 23
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书