{"title":"Bootstrapping results for threshold circuits “just beyond” known lower bounds","authors":"Lijie Chen, R. Tell","doi":"10.1145/3313276.3316333","DOIUrl":"https://doi.org/10.1145/3313276.3316333","url":null,"abstract":"The best known lower bounds for the circuit class TC0 are only slightly super-linear. Similarly, the best known algorithm for derandomization of this class is an algorithm for quantified derandomization (i.e., a weak type of derandomization) of circuits of slightly super-linear size. In this paper we show that even very mild quantitative improvements of either of the two foregoing results would already imply super-polynomial lower bounds for TC0. Specifically: (1) If for every c>1 and sufficiently large d∈ℕ it holds that n-bit TC0 circuits of depth d require n1+c−d wires to compute certain NC1-complete functions, then TC0≠NC1. In fact, even lower bounds for TC0 circuits of size n1+c−d against these functions when c>1 is fixed and sufficiently small would yield lower bounds for polynomial-sized circuits. Lower bounds of the form n1+c−d against these functions are already known, but for a fixed c≈2.41 that is too large to yield new lower bounds via our results. (2) If there exists a deterministic algorithm that gets as input an n-bit TC0 circuit of depth d and n1+(1.61)−d wires, runs in time 2no(1), and distinguishes circuits that accept at most B(n)=2n1−(1.61)−d inputs from circuits that reject at most B(n) inputs, then NEXP⊈TC0. An algorithm for this “quantified derandomization” task is already known, but it works only when the number of wires is n1+c−d, for c>30, and with a smaller B(n)≈2n1−(30/c)d. Intuitively, the “takeaway” message from our work is that the gap between currently-known results and results that would suffice to get super-polynomial lower bounds for TC0 boils down to the precise constant c>1 in the bound n1+c−d on the number of wires. Our results improve previous results of Allender and Koucký (2010) and of the second author (2018), respectively, whose hypotheses referred to circuits with n1+c/d wires (rather than n1+c−d wires). We also prove results similar to two results above for other circuit classes (i.e., ACC0 and CC0).","PeriodicalId":354011,"journal":{"name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","volume":"8 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125861074","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}
Amir Abboud, Raghavendra Addanki, F. Grandoni, Debmalya Panigrahi, B. Saha
{"title":"Dynamic set cover: improved algorithms and lower bounds","authors":"Amir Abboud, Raghavendra Addanki, F. Grandoni, Debmalya Panigrahi, B. Saha","doi":"10.1145/3313276.3316376","DOIUrl":"https://doi.org/10.1145/3313276.3316376","url":null,"abstract":"We give new upper and lower bounds for the dynamic set cover problem. First, we give a (1+є) f-approximation for fully dynamic set cover in O(f2logn/є5) (amortized) update time, for any є > 0, where f is the maximum number of sets that an element belongs to. In the decremental setting, the update time can be improved to O(f2/є5), while still obtaining an (1+є) f-approximation. These are the first algorithms that obtain an approximation factor linear in f for dynamic set cover, thereby almost matching the best bounds known in the offline setting and improving upon the previous best approximation of O(f2) in the dynamic setting. To complement our upper bounds, we also show that a linear dependence of the update time on f is necessary unless we can tolerate much worse approximation factors. Using the recent distributed PCP-framework, we show that any dynamic set cover algorithm that has an amortized update time of O(f1−є) must have an approximation factor that is Ω(nδ) for some constant δ>0 under the Strong Exponential Time Hypothesis.","PeriodicalId":354011,"journal":{"name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129885887","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}
Thomas Dueholm Hansen, Haim Kaplan, Or Zamir, Uri Zwick
{"title":"Faster k-SAT algorithms using biased-PPSZ","authors":"Thomas Dueholm Hansen, Haim Kaplan, Or Zamir, Uri Zwick","doi":"10.1145/3313276.3316359","DOIUrl":"https://doi.org/10.1145/3313276.3316359","url":null,"abstract":"The PPSZ algorithm, due to Paturi, Pudlak, Saks and Zane, is currently the fastest known algorithm for the k-SAT problem, for every k>3. For 3-SAT, a tiny improvement over PPSZ was obtained by Hertli. We introduce a biased version of the PPSZ algorithm using which we obtain an improvement over PPSZ for every k≥ 3. For k=3 we also improve on Herli’s result and get a much more noticeable improvement over PPSZ, though still relatively small. In particular, for Unique 3-SAT, we improve the current bound from 1.308n to 1.307n.","PeriodicalId":354011,"journal":{"name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133834563","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}
{"title":"The parallel repetition of non-signaling games: counterexamples and dichotomy","authors":"Justin Holmgren, Lisa Yang","doi":"10.1145/3313276.3316367","DOIUrl":"https://doi.org/10.1145/3313276.3316367","url":null,"abstract":"Non-signaling games are an important object of study in the theory of computation, for their role both in quantum information and in (classical) cryptography. In this work, we study the behavior of these games under parallel repetition. We show that, unlike the situation both for classical games and for two-player non-signaling games, there are k-player non-signaling games (for k ≥ 3) whose values do not tend to 0 with sufficient parallel repetition. In fact, parallel repetition sometimes does not decrease their value whatsoever. We show that in general, every game’s non-signaling value under parallel repetition is either lower bounded by a positive constant or decreases exponentially with the number of repetitions. Furthermore, exponential decrease occurs if and only if the game’s sub-non-signaling value (Lancien and Winter, CJTCS ’16) is less than 1.","PeriodicalId":354011,"journal":{"name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127785093","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}
{"title":"Explicit 𝑁-vertex graphs with maximum degree 𝐾 and diameter [1+𝑜(1)]log𝐾-1 𝑁 for each 𝐾-1 a prime power","authors":"Michael R. Capalbo","doi":"10.1145/3313276.3316399","DOIUrl":"https://doi.org/10.1145/3313276.3316399","url":null,"abstract":"Here we first present the solution of a long-standing open question–the explicit construction of an infinite family of N-vertex cubic graphs that have diameter [1+o(1)]log2 N. We then extend the techniques to construct, for each K of the form 2s+1 or K=ps+1; s an integer and p a prime, an infinite family of K-regular graphs on N vertices with diameter [1+o(1)]logK−1 N.","PeriodicalId":354011,"journal":{"name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125786630","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}
{"title":"Polylogarithmic approximation for Euler genus on bounded degree graphs","authors":"K. Kawarabayashi, Anastasios Sidiropoulos","doi":"10.1145/3313276.3316409","DOIUrl":"https://doi.org/10.1145/3313276.3316409","url":null,"abstract":"Computing the Euler genus of a graph is a fundamental problem in algorithmic graph theory. It has been shown to be NP-hard by [Thomassen ’89, Thomassen ’97], even for cubic graphs, and a linear-time fixed-parameter algorithm has been obtained by [Mohar ’99]. Despite extensive study, the approximability of the Euler genus remains wide open. While the existence of an O(1)-approximation is not ruled out, the currently best-known upper bound is a O(n1−α)-approximation, for some universal constant α>0 [Kawarabayashi and Sidiropoulos 2017]. We present an O(log2.5 n)-approximation polynomial time algorithm for this problem on graphs of bounded degree. Prior to our work, the best known result on graphs of bounded degree was a nΩ(1)-approximation [Chekuri and Sidiropoulos 2013]. As an immediate corollary, we also obtain improved approximation algorithms for the crossing number problem and for the minimum vertex planarization problem, on graphs of bounded degree. Specifically, we obtain a polynomial-time O(2 log3.5 n)-approximation algorithm for the minimum vertex planarization problem, on graphs of maximum degree . Moreover we obtain an algorithm which given a graph of crossing number k, computes a drawing with at most k2 logO(1) n crossings in polynomial time. This also implies a n1/2 logO(1) n-approximation polynomial time algorithm. The previously best-known result is a polynomial time algorithm that computes a drawing with k10 logO(1) crossings, which implies a n9/10logO(1) n-approximation algorithm [Chuzhoy 2011].","PeriodicalId":354011,"journal":{"name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129871539","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}
{"title":"New polynomial delay bounds for maximal subgraph enumeration by proximity search","authors":"A. Conte, T. Uno","doi":"10.1145/3313276.3316402","DOIUrl":"https://doi.org/10.1145/3313276.3316402","url":null,"abstract":"In this paper we propose polynomial delay algorithms for several maximal subgraph listing problems, by means of a seemingly novel technique which we call proximity search. Our result involves modeling the space of solutions as an implicit directed graph called “solution graph”, a method common to other enumeration paradigms such as reverse search. Such methods, however, can become inefficient due to this graph having vertices with high (potentially exponential) degree. The novelty of our algorithm consists in providing a technique for generating better solution graphs, reducing the out-degree of its vertices with respect to existing approaches, and proving that it remains strongly connected. Applying this technique, we obtain polynomial delay listing algorithms for several problems for which output-sensitive results were, to the best of our knowledge, not known. These include Maximal Bipartite Subgraphs, Maximal k-Degenerate Subgraphs (for bounded k), Maximal Induced Chordal Subgraphs, and Maximal Induced Trees. We present these algorithms, and give insight on how this general technique can be applied to other problems.","PeriodicalId":354011,"journal":{"name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117194547","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}
L. Becchetti, Marc Bury, Vincent Cohen-Addad, F. Grandoni, Chris Schwiegelshohn
{"title":"Oblivious dimension reduction for k-means: beyond subspaces and the Johnson-Lindenstrauss lemma","authors":"L. Becchetti, Marc Bury, Vincent Cohen-Addad, F. Grandoni, Chris Schwiegelshohn","doi":"10.1145/3313276.3316318","DOIUrl":"https://doi.org/10.1145/3313276.3316318","url":null,"abstract":"We show that for n points in d-dimensional Euclidean space, a data oblivious random projection of the columns onto m∈ O((logk+loglogn)ε−6log1/ε) dimensions is sufficient to approximate the cost of all k-means clusterings up to a multiplicative (1±ε) factor. The previous-best upper bounds on m are O(logn· ε−2) given by a direct application of the Johnson-Lindenstrauss Lemma, and O(kε−2) given by [Cohen et al.-STOC’15].","PeriodicalId":354011,"journal":{"name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130620210","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}
{"title":"Weak lower bounds on resource-bounded compression imply strong separations of complexity classes","authors":"D. McKay, Cody Murray, Richard Ryan Williams","doi":"10.1145/3313276.3316396","DOIUrl":"https://doi.org/10.1145/3313276.3316396","url":null,"abstract":"The Minimum Circuit Size Problem (MCSP) asks to determine the minimum size of a circuit computing a given truth table. MCSP is a natural and powerful string compression problem using bounded-size circuits. Recently, Oliveira and Santhanam [FOCS 2018] and Oliveira, Pich, and Santhanam [ECCC 2018] demonstrated a “hardness magnification” phenomenon for MCSP in restricted settings. Letting MCSP[s(n)] be the problem of deciding if a truth table of length 2n has circuit complexity at most s(n), they proved that small (fixed-polynomial) average case circuit/formula lower bounds for MCSP[2√n], or lower bounds for approximating MCSP[2o(n)], would imply major separations such as NP ⊄BPP and NP ⊄P/poly. We strengthen their results in several directions, obtaining magnification results from worst-case lower bounds on exactly computing the search version of generalizations of MCSP[s(n)], which also extend to time-bounded Kolmogorov complexity. In particular, we show that search-MCSP[s(n)] (where we must output a s(n)-size circuit when it exists) admits extremely efficient AC0 circuits and streaming algorithms using Σ3 SAT oracle gates of small fan-in (related to the size s(n) we want to test). For A : {0,1}⋆ → {0,1}, let search-oracleMCSPA[s(n)] be the problem: Given a truth table T of size N=2n, output a Boolean circuit for T of size at most s(n) with AND, OR, NOT, and A-oracle gates (or report that no such circuit exists). Some consequences of our results are: (1) For reasonable s(n) ≥ n and A ∈ PH, if search-MCSPA[s(n)] does not have a 1-pass deterministic poly(s(n))-space streaming algorithm with poly(s(n)) update time, then P ≠ NP. For example, proving that it is impossible to synthesize SAT-oracle circuits of size 2n/log⋆ n with a streaming algorithm on truth tables of length N=2n using Nε update time and Nε space on length-N inputs (for some ε > 0) would already separate P and NP. Note that some extremely simple functions, such as EQUALITY of two strings, already satisfy such lower bounds. (2) If search-MCSP[nc] lacks Õ(N)-size, Õ(1)-depth circuits for a c ≥ 1, then NP ⊄P/poly. (3) If search-MCSP[s(n)] does not have N · poly(s(n))-size, O(logN)-depth circuits, then NP ⊄NC1. Note it is known that MCSP[2√n] does not have formulas of N1.99 size [Hirahara and Santhanam, CCC 2017]. (4) If there is an ε > 0 such that for all c ≥ 1, search-MCSP[2n/c] does not have N1+ε-size O(1/ε)-depth ACC0 circuits, then NP ⊄ACC0. Thus the amplification results of Allender and Koucký [JACM 2010] can extend to problems in NP and beyond. Furthermore, if we substitute ⊕ P, PP, PSPACE, or EXP-complete problems for the oracle A, we obtain separations for those corresponding complexity classes instead of NP. Analogues of the above results hold for time-bounded Kolmogorov complexity as well.","PeriodicalId":354011,"journal":{"name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128408256","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}
{"title":"Planar diameter via metric compression","authors":"Jason Li, M. Parter","doi":"10.1145/3313276.3316358","DOIUrl":"https://doi.org/10.1145/3313276.3316358","url":null,"abstract":"We develop a new approach for distributed distance computation in planar graphs that is based on a variant of the metric compression problem recently introduced by Abboud et al. [SODA’18]. In our variant of the Planar Graph Metric Compression Problem, one is given an n-vertex planar graph G=(V,E), a set of S ⊆ V source terminals lying on a single face, and a subset of target terminals T ⊆ V. The goal is to compactly encode the S× T distances. One of our key technical contributions is in providing a compression scheme that encodes all S × T distances using O(|S|·(D)+|T|) bits, for unweighted graphs with diameter D. This significantly improves the state of the art of O(|S|· 2D+|T| · D) bits. We also consider an approximate version of the problem for weighted graphs, where the goal is to encode (1+є) approximation of the S × T distances, for a given input parameter є ∈ (0,1]. Here, our compression scheme uses O((|S|/є)+|T|) bits. In addition, we describe how these compression schemes can be computed in near-linear time. At the heart of this compact compression scheme lies a VC-dimension type argument on planar graphs, using the well-known Sauer’’s lemma. This efficient compression scheme leads to several improvements and simplifications in the setting of diameter computation, most notably in the distributed setting: There is an O(D5)-round randomized distributed algorithm for computing the diameter in planar graphs, w.h.p. There is an O(D3)+D2(logn/є)-round randomized distributed algorithm for computing a (1+є) approximation for the diameter in weighted planar graphs, with unweighted diameter D, w.h.p. No sublinear round algorithms were known for these problems before. These distributed constructions are based on a new recursive graph decomposition that preserves the (unweighted) diameter of each of the subgraphs up to a logarithmic term. Using this decomposition, we also get an exact SSSP tree computation within O(D2) rounds.","PeriodicalId":354011,"journal":{"name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","volume":"1089 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113988395","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}