{"@context":"https:\/\/schema.org\/","@type":"PublicationVolume","@id":"#volume6270","volumeNumber":67,"name":"8th Innovations in Theoretical Computer Science Conference (ITCS 2017)","dateCreated":"2017-11-28","datePublished":"2017-11-28","editor":{"@type":"Person","name":"Papadimitriou, Christos H.","givenName":"Christos H.","familyName":"Papadimitriou"},"isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":{"@type":"Periodical","@id":"#series116","name":"Leibniz International Proceedings in Informatics","issn":"1868-8969","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#volume6270"},"hasPart":[{"@type":"ScholarlyArticle","@id":"#article9353","name":"LIPIcs, Volume 67, ITCS'17, Complete Volume","abstract":"LIPIcs, Volume 67, ITCS'17, Complete Volume","keywords":"Theory of Computation, Mathematics of Computing","author":{"@type":"Person","name":"Papadimitriou, Christos H.","givenName":"Christos H.","familyName":"Papadimitriou"},"position":-1,"pageStart":0,"pageEnd":0,"dateCreated":"2017-12-04","datePublished":"2017-12-04","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":{"@type":"Person","name":"Papadimitriou, Christos H.","givenName":"Christos H.","familyName":"Papadimitriou"},"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9354","name":"Front Matter, Table of Contents, Preface, Conference Organization","abstract":"Front Matter, Table of Contents, Preface, Conference Organization","keywords":["Front Matter","Table of Contents","Preface","Conference Organization"],"author":{"@type":"Person","name":"Papadimitriou, Christos H.","givenName":"Christos H.","familyName":"Papadimitriou"},"position":0,"pageStart":"0:i","pageEnd":"0:x","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":{"@type":"Person","name":"Papadimitriou, Christos H.","givenName":"Christos H.","familyName":"Papadimitriou"},"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.0","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9355","name":"Separators in Region Intersection Graphs","abstract":"For undirected graphs G=(V,E) and G_0=(V_0,E_0), say that G is a region intersection graph over G_0 if there is a family of connected subsets {R_u \\subseteq V_0 : u \\in V} of G_0 such that {u,v} \\in E \\iff R_u \\cap R_v \\neq \\emptyset.\r\n\r\nWe show if G_0 excludes the complete graph K_h as a minor for some h \\geq 1, then every region intersection graph G over G_0 with m edges has a balanced separator with at most c_h \\sqrt{m} nodes, where c_h is a constant depending only on h. If G additionally has uniformly bounded vertex degrees, then such a separator is found by spectral partitioning.\r\n\r\nA string graph is the intersection graph of continuous arcs in the plane. String graphs are precisely region intersection graphs over planar graphs. Thus the preceding result implies that every string graph with m edges has a balanced separator of size O(\\sqrt{m}). This bound is optimal, as it generalizes the planar separator theorem. It confirms a conjecture of Fox and Pach (2010), and improves over the O(\\sqrt{m} \\log m) bound of Matousek (2013).","keywords":["Graph separators","planar graphs","spectral partitioning"],"author":{"@type":"Person","name":"Lee, James R.","givenName":"James R.","familyName":"Lee"},"position":1,"pageStart":"1:1","pageEnd":"1:8","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":{"@type":"Person","name":"Lee, James R.","givenName":"James R.","familyName":"Lee"},"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.1","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["http:\/\/dx.doi.org\/10.1145\/1706591.1706593","http:\/\/dx.doi.org\/10.1137\/05064299X","http:\/\/dx.doi.org\/10.1017\/S0963548309990459","http:\/\/dx.doi.org\/10.1017\/S0963548313000412","http:\/\/dx.doi.org\/10.1016\/j.jctb.2009.03.005","http:\/\/dx.doi.org\/10.1016\/0095-8956(91)90091-W","http:\/\/dx.doi.org\/10.1016\/0095-8956(91)90050-T","https:\/\/arxiv.org\/abs\/1608.01612","http:\/\/dx.doi.org\/10.1137\/0136016","http:\/\/dx.doi.org\/10.1007\/s11856-016-1315-8","http:\/\/dx.doi.org\/10.1017\/S0963548313000400","http:\/\/dx.doi.org\/10.1145\/256292.256294","http:\/\/dx.doi.org\/10.1016\/S0022-0000(03)00045-X","http:\/\/dx.doi.org\/10.1016\/j.jcss.2003.07.002"],"isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9356","name":"Gradient Descent Only Converges to Minimizers: Non-Isolated Critical Points and Invariant Regions","abstract":"Given a twice continuously differentiable cost function f, we prove that the set of initial conditions so that gradient descent converges to saddle points where \\nabla^2 f has at least one strictly negative eigenvalue, has (Lebesgue) measure zero, even for cost functions f with non-isolated critical points, answering an open question in [Lee, Simchowitz, Jordan, Recht, COLT 2016]. Moreover, this result extends to forward-invariant convex subspaces, allowing for weak (non-globally Lipschitz) smoothness assumptions. Finally, we produce an upper bound on the allowable step-size.","keywords":["Gradient Descent","Center-stable manifold","Saddle points","Hessian"],"author":[{"@type":"Person","name":"Panageas, Ioannis","givenName":"Ioannis","familyName":"Panageas"},{"@type":"Person","name":"Piliouras, Georgios","givenName":"Georgios","familyName":"Piliouras"}],"position":2,"pageStart":"2:1","pageEnd":"2:12","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Panageas, Ioannis","givenName":"Ioannis","familyName":"Panageas"},{"@type":"Person","name":"Piliouras, Georgios","givenName":"Georgios","familyName":"Piliouras"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.2","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9357","name":"Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent","abstract":"First-order methods play a central role in large-scale machine learning. Even though many variations exist, each suited to a particular problem, almost all such methods fundamentally rely on two types of algorithmic steps: gradient descent, which yields primal progress, and mirror descent, which yields dual progress.\r\n\r\nWe observe that the performances of gradient and mirror descent are complementary, so that faster algorithms can be designed by \"linearly coupling\" the two. We show how to reconstruct Nesterov's accelerated gradient methods using linear coupling, which gives a cleaner interpretation than Nesterov's original proofs. We also discuss the power of linear coupling by extending it to many other settings that Nesterov's methods cannot apply to.","keywords":["linear coupling","gradient descent","mirror descent","acceleration"],"author":[{"@type":"Person","name":"Allen-Zhu, Zeyuan","givenName":"Zeyuan","familyName":"Allen-Zhu"},{"@type":"Person","name":"Orecchia, Lorenzo","givenName":"Lorenzo","familyName":"Orecchia"}],"position":3,"pageStart":"3:1","pageEnd":"3:22","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Allen-Zhu, Zeyuan","givenName":"Zeyuan","familyName":"Allen-Zhu"},{"@type":"Person","name":"Orecchia, Lorenzo","givenName":"Lorenzo","familyName":"Orecchia"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.3","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["http:\/\/dx.doi.org\/10.1109\/SFCS.2005.35","http:\/\/dx.doi.org\/10.4086\/toc.2012.v008a006","http:\/\/dx.doi.org\/10.1137\/1.9780898718829","http:\/\/arxiv.org\/abs\/abs\/1506.08187","http:\/\/arxiv.org\/abs\/1012.1367","http:\/\/dx.doi.org\/10.1007\/s10994-007-5016-8","http:\/\/dx.doi.org\/10.1137\/1.9781611973402.16","http:\/\/dx.doi.org\/10.1007\/s10107-010-0434-y","http:\/\/arxiv.org\/abs\/1002.4908","http:\/\/dx.doi.org\/10.1007\/s10107-004-0552-5","http:\/\/dx.doi.org\/10.1007\/s10107-007-0149-x","http:\/\/dx.doi.org\/10.1007\/s10107-012-0629-5","http:\/\/dx.doi.org\/10.1007\/s10107-014-0790-0","http:\/\/dx.doi.org\/10.1007\/s10208-013-9150-3","http:\/\/dx.doi.org\/10.1287\/moor.20.2.257","http:\/\/arxiv.org\/abs\/0909.1062","http:\/\/dx.doi.org\/10.1561\/2200000018","http:\/\/arxiv.org\/abs\/1305.2581","http:\/\/arxiv.org\/abs\/1212.1824"],"isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9358","name":"High Dimensional Random Walks and Colorful Expansion","abstract":"Random walks on bounded degree expander graphs have numerous applications, both in theoretical and practical computational problems. A key property of these walks is that they converge rapidly to their stationary distribution.\r\n\t\r\nIn this work we define high order random walks: These are generalizations of random walks on graphs to high dimensional simplicial complexes, which are the high dimensional analogues of graphs. A simplicial complex of dimension d has vertices, edges, triangles, pyramids, up to d-dimensional cells. For any 0 \\leq i < d, a high order random walk on dimension i moves between neighboring i-faces (e.g., edges) of the complex, where two i-faces are considered neighbors if they share a common (i+1)-face (e.g., a triangle). The case of i=0 recovers the well studied random walk on graphs.\r\n\t\r\nWe provide a local-to-global criterion on a complex which implies rapid convergence of all high order random walks on it. Specifically, we prove that if the 1-dimensional skeletons of all the links of a complex are spectral expanders, then for all 0 \\le i < d the high order random walk on dimension i converges rapidly to its stationary distribution.\r\n\t\r\nWe derive our result through a new notion of high dimensional combinatorial expansion of complexes which we term colorful expansion. This notion is a natural generalization of combinatorial expansion of graphs and is strongly related to the convergence rate of the high order random walks.\r\n\t\r\nWe further show an explicit family of bounded degree complexes which satisfy this criterion. Specifically, we show that Ramanujan complexes meet this criterion, and thus form an explicit family of bounded degree high dimensional simplicial complexes in which all of the high order random walks converge rapidly to their stationary distribution.","keywords":["High dimensional expanders","expander graphs","random walks"],"author":[{"@type":"Person","name":"Kaufman, Tali","givenName":"Tali","familyName":"Kaufman"},{"@type":"Person","name":"Mass, David","givenName":"David","familyName":"Mass"}],"position":4,"pageStart":"4:1","pageEnd":"4:27","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Kaufman, Tali","givenName":"Tali","familyName":"Kaufman"},{"@type":"Person","name":"Mass, David","givenName":"David","familyName":"Mass"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.4","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":"http:\/\/lucatrevisan.wordpress.com\/2016\/02\/09\/cheeger-type-inequalities-for-%CE%BBn\/","isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9359","name":"Real Stability Testing","abstract":"We give a strongly polynomial time algorithm which determines whether or not a bivariate polynomial is real stable. As a corollary, this implies an algorithm for testing whether a given linear transformation on univariate polynomials preserves real-rootedness. The proof exploits properties of hyperbolic polynomials to reduce real stability testing to testing nonnegativity of a finite number of polynomials on an interval.","keywords":["real stable polynomials","hyperbolic polynomials","real rootedness","moment matrix","sturm sequence"],"author":[{"@type":"Person","name":"Raghavendra, Prasad","givenName":"Prasad","familyName":"Raghavendra"},{"@type":"Person","name":"Ryder, Nick","givenName":"Nick","familyName":"Ryder"},{"@type":"Person","name":"Srivastava, Nikhil","givenName":"Nikhil","familyName":"Srivastava"}],"position":5,"pageStart":"5:1","pageEnd":"5:15","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Raghavendra, Prasad","givenName":"Prasad","familyName":"Raghavendra"},{"@type":"Person","name":"Ryder, Nick","givenName":"Nick","familyName":"Ryder"},{"@type":"Person","name":"Srivastava, Nikhil","givenName":"Nikhil","familyName":"Srivastava"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.5","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":"http:\/\/dx.doi.org\/10.1145\/800205.806320","isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9360","name":"Very Simple and Efficient Byzantine Agreement","abstract":"We present a very simple, cryptographic, binary Byzantine-agreement protocol that, with n >= 3t+1 >= 3 players, at most t of which are malicious, halts in expected 9 rounds.","keywords":"Byzantine Agreement","author":{"@type":"Person","name":"Micali, Silvio","givenName":"Silvio","familyName":"Micali"},"position":6,"pageStart":"6:1","pageEnd":"6:1","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":{"@type":"Person","name":"Micali, Silvio","givenName":"Silvio","familyName":"Micali"},"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.6","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9361","name":"Low-Complexity Cryptographic Hash Functions","abstract":"Cryptographic hash functions are efficiently computable functions that shrink a long input into a shorter output while achieving some of the useful security properties of a random function.\r\nThe most common type of such hash functions is collision resistant hash functions (CRH), which prevent an efficient attacker from finding a pair of inputs on which the function has the same output.","keywords":["Cryptography","hash functions","complexity theory","coding theory"],"author":[{"@type":"Person","name":"Applebaum, Benny","givenName":"Benny","familyName":"Applebaum"},{"@type":"Person","name":"Haramaty-Krasne, Naama","givenName":"Naama","familyName":"Haramaty-Krasne"},{"@type":"Person","name":"Ishai, Yuval","givenName":"Yuval","familyName":"Ishai"},{"@type":"Person","name":"Kushilevitz, Eyal","givenName":"Eyal","familyName":"Kushilevitz"},{"@type":"Person","name":"Vaikuntanathan, Vinod","givenName":"Vinod","familyName":"Vaikuntanathan"}],"position":7,"pageStart":"7:1","pageEnd":"7:31","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Applebaum, Benny","givenName":"Benny","familyName":"Applebaum"},{"@type":"Person","name":"Haramaty-Krasne, Naama","givenName":"Naama","familyName":"Haramaty-Krasne"},{"@type":"Person","name":"Ishai, Yuval","givenName":"Yuval","familyName":"Ishai"},{"@type":"Person","name":"Kushilevitz, Eyal","givenName":"Eyal","familyName":"Kushilevitz"},{"@type":"Person","name":"Vaikuntanathan, Vinod","givenName":"Vinod","familyName":"Vaikuntanathan"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.7","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9362","name":"Hierarchical Functional Encryption","abstract":"Functional encryption provides fine-grained access control for encrypted data, allowing each user to learn only specific functions of the encrypted data. We study the notion of hierarchical functional encryption, which augments functional encryption with delegation capabilities, offering significantly more expressive access control.\r\n\r\nWe present a generic transformation that converts any general-purpose public-key functional encryption scheme into a hierarchical one without relying on any additional assumptions. This significantly refines our understanding of the power of functional encryption, showing that the existence of functional encryption is equivalent to that of its hierarchical generalization.\r\n\r\nInstantiating our transformation with the existing functional encryption schemes yields a variety of hierarchical schemes offering various trade-offs between their delegation capabilities (i.e., the depth and width of their hierarchical structures) and underlying assumptions. When starting with a scheme secure against an unbounded number of collusions, we can support arbitrary hierarchical structures. In addition, even when starting with schemes that are secure against a bounded number of collusions (which are known to exist under rather minimal assumptions such as the existence of public-key encryption and shallow pseudorandom generators), we can support hierarchical structures of bounded depth and width.","keywords":["Functional Encryption","Delegatable Encryption","Cryptography"],"author":[{"@type":"Person","name":"Brakerski, Zvika","givenName":"Zvika","familyName":"Brakerski"},{"@type":"Person","name":"Chandran, Nishanth","givenName":"Nishanth","familyName":"Chandran"},{"@type":"Person","name":"Goyal, Vipul","givenName":"Vipul","familyName":"Goyal"},{"@type":"Person","name":"Jain, Aayush","givenName":"Aayush","familyName":"Jain"},{"@type":"Person","name":"Sahai, Amit","givenName":"Amit","familyName":"Sahai"},{"@type":"Person","name":"Segev, Gil","givenName":"Gil","familyName":"Segev"}],"position":8,"pageStart":"8:1","pageEnd":"8:27","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Brakerski, Zvika","givenName":"Zvika","familyName":"Brakerski"},{"@type":"Person","name":"Chandran, Nishanth","givenName":"Nishanth","familyName":"Chandran"},{"@type":"Person","name":"Goyal, Vipul","givenName":"Vipul","familyName":"Goyal"},{"@type":"Person","name":"Jain, Aayush","givenName":"Aayush","familyName":"Jain"},{"@type":"Person","name":"Sahai, Amit","givenName":"Amit","familyName":"Sahai"},{"@type":"Person","name":"Segev, Gil","givenName":"Gil","familyName":"Segev"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.8","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":"http:\/\/www.cs.utexas.edu\/~bwaters\/presentations\/files\/functional.ppt","isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9363","name":"Inferential Privacy Guarantees for Differentially Private Mechanisms","abstract":"The following is a summary of the paper \"Inferential Privacy Guarantees for Differentially Private Mechanisms\", presented at the Eighth Innovations in Theoretical Computer Science Conference in January 2017. The full version of the paper can be found on arXiv at the URL https:\/\/arxiv.org\/abs\/1603.01508.","keywords":["differential privacy","statistical inference","statistical mechanics"],"author":[{"@type":"Person","name":"Ghosh, Arpita","givenName":"Arpita","familyName":"Ghosh"},{"@type":"Person","name":"Kleinberg, Robert","givenName":"Robert","familyName":"Kleinberg"}],"position":9,"pageStart":"9:1","pageEnd":"9:3","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Ghosh, Arpita","givenName":"Arpita","familyName":"Ghosh"},{"@type":"Person","name":"Kleinberg, Robert","givenName":"Robert","familyName":"Kleinberg"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.9","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9364","name":"Towards Human Computable Passwords","abstract":"An interesting challenge for the cryptography community is to design authentication protocols that are so simple that a human can execute them \r\nwithout relying on a fully trusted computer. We propose several candidate authentication protocols for a setting in which the human user can \r\nonly receive assistance from a semi-trusted computer - a computer that stores information and performs computations correctly \r\nbut does not provide confidentiality. Our schemes use a semi-trusted computer to store and display public challenges C_i\\in[n]^k. \r\nThe human user memorizes a random secret mapping \\sigma:[n]\\rightarrow \\mathbb{Z}_d and authenticates by computing responses f(\\sigma(C_i)) to \r\na sequence of public challenges where f:\\mathbb{Z}_d^k\\rightarrow \\mathbb{Z}_d is a function that is easy for the human to evaluate. We prove \r\nthat any statistical adversary needs to sample m=\\tilde{\\Omega}\\paren{n^{s(f)}} challenge-response pairs to recover \\sigma, for a security \r\nparameter s(f) that depends on two key properties of f. Our lower bound generalizes recent results of Feldman et al. [Feldman'15]\r\nwho proved analogous results for the special case d=2. To obtain our results, we apply the general hypercontractivity theorem [O'Donnell'14]\r\nto lower bound the statistical dimension of the distribution over challenge-response pairs induced by f and \\sigma. \r\nOur statistical dimension lower bounds apply to arbitrary functions f:\\mathbb{Z}_d^k\\rightarrow \\mathbb{Z}_d (not just to functions that \r\nare easy for a human to evaluate). As an application, we propose a family of human computable password \r\nfunctions f_{k_1,k_2} in which the user needs to perform 2k_1+2k_2+1 primitive operations (e.g., adding two digits or remembering a \r\nsecret value \\sigma(i)), and we show that s(f) = \\min{k_1+1, (k_2+1)\/2}. For these schemes, we prove that forging passwords is \r\nequivalent to recovering the secret mapping. Thus, our human computable password schemes can maintain strong security guarantees even after \r\nan adversary has observed the user login to many different accounts.","keywords":["Passwords","Cognitive Authentication","Human Computation","Planted Constraint Satisfaction Problem","Statistical Dimension"],"author":[{"@type":"Person","name":"Blocki, Jeremiah","givenName":"Jeremiah","familyName":"Blocki"},{"@type":"Person","name":"Blum, Manuel","givenName":"Manuel","familyName":"Blum"},{"@type":"Person","name":"Datta, Anupam","givenName":"Anupam","familyName":"Datta"},{"@type":"Person","name":"Vempala, Santosh","givenName":"Santosh","familyName":"Vempala"}],"position":10,"pageStart":"10:1","pageEnd":"10:47","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Blocki, Jeremiah","givenName":"Jeremiah","familyName":"Blocki"},{"@type":"Person","name":"Blum, Manuel","givenName":"Manuel","familyName":"Blum"},{"@type":"Person","name":"Datta, Anupam","givenName":"Anupam","familyName":"Datta"},{"@type":"Person","name":"Vempala, Santosh","givenName":"Santosh","familyName":"Vempala"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.10","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["http:\/\/www.cert.org\/incident_notes\/IN-98.03.html","http:\/\/www.theregister.co.uk\/2011\/06\/24\/nato_hack_attack\/","http:\/\/www.usatoday.com\/tech\/news\/story\/2012-01-16\/mark-smith-zappos-breach-tips\/52593484\/1","http:\/\/blogs.atlassian.com\/news\/2010\/04\/oh_man_what_a_day_an_update_on_our_security_breach.html","http:\/\/www.zdnet.com\/blog\/security\/apple-security-blunder-exposes-lion-login-passwords-in-clear-text\/11963","http:\/\/blog.us.playstation.com\/2011\/04\/22\/update-on-playstation-network-qriocity-services\/","http:\/\/blog.linkedin.com\/2012\/06\/06\/linkedin-member-passwords-compromised\/","http:\/\/ieeelog.com\/","http:\/\/blogs.adobe.com\/conversations\/2013\/10\/important-customer-security-announcement.html","http:\/\/gizmodo.com\/5820049\/anonymous-leaks-90000-military-email-accounts-in-latest-antisec-attack","http:\/\/asiacrypt.2013.rump.cr.yp.to\/b0279d7741ad5bab24cf5c55fd292d5c.pdf","http:\/\/dx.doi.org\/10.1007\/978-3-642-42045-0_19","http:\/\/www.internetsociety.org\/doc\/spaced-repetition-and-mnemonics-enable-recall-multiple-strong-passwords","http:\/\/dx.doi.org\/10.1145\/321033.321034","http:\/\/scienceblogs.com\/cognitivedaily\/2007\/02\/is_17_the_most_random_number.php","http:\/\/analysisofbooleanfunctions.org\/"],"isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9365","name":"Towards Hardness of Approximation for Polynomial Time Problems","abstract":"Proving hardness of approximation is a major challenge in the field of fine-grained complexity and conditional lower bounds in P.\r\nHow well can the Longest Common Subsequence (LCS) or the Edit Distance be approximated by an algorithm that runs in near-linear time?\r\nIn this paper, we make progress towards answering these questions.\r\nWe introduce a framework that exhibits barriers for truly subquadratic and deterministic algorithms with good approximation guarantees.\r\nOur framework highlights a novel connection between deterministic approximation algorithms for natural problems in P and circuit lower bounds.\r\n\r\nIn particular, we discover a curious connection of the following form:\r\nif there exists a \\delta>0 such that for all \\eps>0 there is a deterministic (1+\\eps)-approximation algorithm for LCS on two sequences of length n over an alphabet of size n^{o(1)} that runs in O(n^{2-\\delta}) time, then a certain plausible hypothesis is refuted, and the class E^NP does not have non-uniform linear size Valiant Series-Parallel circuits.\r\nThus, designing a \"truly subquadratic PTAS\" for LCS is as hard as resolving an old open question in complexity theory.","keywords":["LCS","Edit Distance","Hardness in P"],"author":[{"@type":"Person","name":"Abboud, Amir","givenName":"Amir","familyName":"Abboud"},{"@type":"Person","name":"Backurs, Arturs","givenName":"Arturs","familyName":"Backurs"}],"position":11,"pageStart":"11:1","pageEnd":"11:26","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Abboud, Amir","givenName":"Amir","familyName":"Abboud"},{"@type":"Person","name":"Backurs, Arturs","givenName":"Arturs","familyName":"Backurs"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.11","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["http:\/\/dx.doi.org\/10.1145\/1007352.1007361","http:\/\/dx.doi.org\/10.1137\/1.9781611973730.66","http:\/\/arxiv.org\/abs\/1408.1340","http:\/\/web.stanford.edu\/~rrwill\/ICM-survey.pdf"],"isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9366","name":"Parameterized Property Testing of Functions","abstract":"We investigate the parameters in terms of which the complexity of sublinear-time algorithms should be expressed. Our goal is to find input parameters that are tailored to the combinatorics of the specific problem being studied and design algorithms that run faster when these parameters are small. This direction enables us to surpass the (worst-case) lower bounds, expressed in terms of the input size, for several problems. Our aim is to develop a similar level of understanding of the complexity of sublinear-time algorithms to the one that was enabled by research in parameterized complexity for classical algorithms.\r\n\r\nSpecifically, we focus on testing properties of functions. By parameterizing the query complexity in terms of the size r of the image of the input function, we obtain testers for monotonicity and convexity of functions of the form f:[n]\\to \\mathbb{R} with query complexity O(\\log r), with no dependence on n. The result for monotonicity circumvents the \\Omega(\\log n) lower bound by Fischer (Inf. Comput., 2004) for this problem. We present several other parameterized testers, providing compelling evidence that expressing the query complexity of property testers in terms of the input size is not always the best choice.","keywords":["Sublinear algorithms","property testing","parameterization","monotonicity","convexity"],"author":[{"@type":"Person","name":"Pallavoor, Ramesh Krishnan S.","givenName":"Ramesh Krishnan S.","familyName":"Pallavoor"},{"@type":"Person","name":"Raskhodnikova, Sofya","givenName":"Sofya","familyName":"Raskhodnikova"},{"@type":"Person","name":"Varma, Nithin","givenName":"Nithin","familyName":"Varma"}],"position":12,"pageStart":"12:1","pageEnd":"12:17","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Pallavoor, Ramesh Krishnan S.","givenName":"Ramesh Krishnan S.","familyName":"Pallavoor"},{"@type":"Person","name":"Raskhodnikova, Sofya","givenName":"Sofya","familyName":"Raskhodnikova"},{"@type":"Person","name":"Varma, Nithin","givenName":"Nithin","familyName":"Varma"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.12","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":"https:\/\/cseweb.ucsd.edu\/~mihir\/cse207\/w-birthday.pdf","isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9367","name":"The Complexity of Problems in P Given Correlated Instances","abstract":"Instances of computational problems do not exist in isolation. Rather, multiple and correlated instances of the same problem arise naturally in the real world. The challenge is how to gain computationally from correlations when they can be found. \r\n[DGH, ITCS 2015] showed that significant computational gains can be made by having access to auxiliary instances which are correlated to the primary problem instance via the solution space. They demonstrate this for constraint satisfaction problems, which are NP-hard in the general worst case form.\r\n\r\nHere, we set out to study the impact of having access to correlated instances on the complexity of polynomial time problems. Namely, for a problem P that is conjectured to require time n^c for c>0, \r\nwe ask whether access to a few instances of P that are correlated in some natural way can be used to solve P on one of them (the designated \"primary instance\") faster than the conjectured lower bound of n^c. \r\n\r\nWe focus our attention on a number of problems: the Longest Common Subsequence (LCS), the minimum Edit Distance between sequences, and Dynamic Time Warping Distance (DTWD) of curves, for all of which the best known algorithms achieve O(n^2\/polylog(n)) runtime via dynamic programming. These problems form an interesting case in point to study, as it has been shown that a O(n^(2 - epsilon)) time algorithm for a worst-case instance would imply improved algorithms \r\nfor a host of other problems as well as disprove complexity hypotheses such as the Strong Exponential Time Hypothesis.\r\n\r\nWe show how to use access to a logarithmic number of auxiliary correlated instances, to design novel o(n^2) time algorithms for LCS, EDIT, DTWD, and more generally improved algorithms for computing any tuple-based similarity measure - a generalization which we define within on strings. For the multiple sequence alignment problem on k strings, this yields an O(nk\\log n) algorithm \r\ncontrasting with classical O(n^k) dynamic programming. \r\n\r\nOur results hold for several correlation models between the primary and the auxiliary instances. In the most general correlation model we address, we assume that the primary instance is a worst-case instance and the auxiliary instances are chosen with uniform distribution subject to the constraint that their alignments are\r\nepsilon-correlated with the optimal alignment of the primary instance. We emphasize that optimal solutions for the auxiliary instances will not generally coincide with optimal solutions for the worst case primary instance.\r\n\r\nWe view our work as pointing out a new avenue for looking for significant improvements for sequence alignment problems and\r\ncomputing similarity measures, by taking advantage of access to sequences which are correlated through natural generating processes. \r\nIn this first work we show how to take advantage of mathematically inspired simple clean models of correlation - the intriguing question, looking forward, is to find correlation models which coincide with evolutionary models and other relationships and for which our approach to multiple sequence alignment gives provable guarantees.","keywords":["Correlated instances","Longest Common Subsequence","Fine-grained complexity"],"author":[{"@type":"Person","name":"Goldwasser, Shafi","givenName":"Shafi","familyName":"Goldwasser"},{"@type":"Person","name":"Holden, Dhiraj","givenName":"Dhiraj","familyName":"Holden"}],"position":13,"pageStart":"13:1","pageEnd":"13:19","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Goldwasser, Shafi","givenName":"Shafi","familyName":"Goldwasser"},{"@type":"Person","name":"Holden, Dhiraj","givenName":"Dhiraj","familyName":"Holden"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.13","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":"http:\/\/dx.doi.org\/10.1145\/2688073.2688082","isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9368","name":"Multi-Clique-Width","abstract":"Multi-clique-width is obtained by a simple modification in the definition of clique-width. It has the advantage of providing a natural extension of tree-width. Unlike clique-width, it does not explode exponentially compared to tree-width. Efficient algorithms based on multi-clique-width are still possible for interesting tasks like computing the independent set polynomial or testing c-colorability. In particular, c-colorability can be tested in time linear in n and singly exponential in c and the width k of a given multi-k-expression. For these tasks, the running time as a function of the multi-clique-width is the same as the running time of the fastest known algorithm as a function of the clique-width. This results in an exponential speed-up for some graphs, if the corresponding graph generating expressions are given. The reason is that the multi-clique-width is never bigger, but is exponentially smaller than the clique-width for many graphs. This gap shows up when the tree-width is basically equal to the multi-clique width as well as when the tree-width is not bounded by any function of the clique-width.","keywords":["clique-width","parameterized complexity","tree-width","independent set polynomial","graph coloring"],"author":{"@type":"Person","name":"F\u00fcrer, Martin","givenName":"Martin","familyName":"F\u00fcrer"},"position":14,"pageStart":"14:1","pageEnd":"14:13","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":{"@type":"Person","name":"F\u00fcrer, Martin","givenName":"Martin","familyName":"F\u00fcrer"},"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.14","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["http:\/\/dx.doi.org\/10.1137\/S0097539793251219","http:\/\/dx.doi.org\/10.1006\/jagm.1995.1009","http:\/\/dx.doi.org\/10.1016\/j.tcs.2011.05.022","http:\/\/dx.doi.org\/10.1137\/S0097539701385351","http:\/\/dx.doi.org\/10.1016\/0890-5401(90)90043-H","http:\/\/dx.doi.org\/10.1016\/0022-0000(93)90004-G","http:\/\/dx.doi.org\/10.1007\/s002249910009","http:\/\/dx.doi.org\/10.1016\/S0166-218X(00)00221-3","http:\/\/dx.doi.org\/10.1016\/S0166-218X(99)00184-5","http:\/\/springerlink.metapress.com\/content\/b3268gtk313180q0\/","http:\/\/dx.doi.org\/10.1007\/978-1-4471-5559-1","http:\/\/dx.doi.org\/10.1145\/1132516.1132568","http:\/\/dx.doi.org\/10.1016\/j.dam.2006.06.020","http:\/\/arxiv.org\/abs\/1511.01379","http:\/\/dx.doi.org\/10.1007\/978-3-642-54423-1","http:\/\/dx.doi.org\/10.1016\/j.dam.2009.10.018","http:\/\/dx.doi.org\/10.1137\/070685920","http:\/\/dx.doi.org\/10.1145\/1435375.1435385","http:\/\/dx.doi.org\/10.1016\/j.jctb.2005.10.006","http:\/\/dx.doi.org\/10.1016\/0095-8956(84)90013-3","http:\/\/dx.doi.org\/10.1007\/978-3-319-12340-0"],"isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9369","name":"Computational Tradeoffs in Biological Neural Networks: Self-Stabilizing Winner-Take-All Networks","abstract":"We initiate a line of investigation into biological neural networks from an algorithmic perspective. We develop a simplified but biologically plausible model for distributed computation in stochastic spiking neural networks and study tradeoffs between computation time and network complexity in this model. Our aim is to abstract real neural networks in a way that, while not capturing all interesting features, preserves high-level behavior and allows us to make biologically relevant conclusions.\r\n\r\nIn this paper, we focus on the important 'winner-take-all' (WTA) problem, which is analogous to a neural leader election unit: a network consisting of $n$ input neurons and n corresponding output neurons must converge to a state in which a single output corresponding to a firing input (the 'winner') fires, while all other outputs remain silent. Neural circuits for WTA rely on inhibitory neurons, which suppress the activity of competing outputs and drive the network towards a converged state with a single firing winner. We attempt to understand how the number of inhibitors used affects network convergence time.\r\n\r\nWe show that it is possible to significantly outperform naive WTA constructions through a more refined use of inhibition, solving the problem in O(\\theta) rounds in expectation with just O(\\log^{1\/\\theta} n) inhibitors for any \\theta. An alternative construction gives convergence in O(\\log^{1\/\\theta} n) rounds with O(\\theta) inhibitors. We complement these upper bounds with our main technical contribution, a nearly matching lower bound for networks using \\ge \\log \\log n inhibitors. Our lower bound uses familiar indistinguishability and locality arguments from distributed computing theory applied to the neural setting. It lets us derive a number of interesting conclusions about the structure of any network solving WTA with good probability, and the use of randomness and inhibition within such a network.","keywords":["biological distributed algorithms","neural networks","distributed lower bounds","winner-take-all networks"],"author":[{"@type":"Person","name":"Lynch, Nancy","givenName":"Nancy","familyName":"Lynch"},{"@type":"Person","name":"Musco, Cameron","givenName":"Cameron","familyName":"Musco"},{"@type":"Person","name":"Parter, Merav","givenName":"Merav","familyName":"Parter"}],"position":15,"pageStart":"15:1","pageEnd":"15:44","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Lynch, Nancy","givenName":"Nancy","familyName":"Lynch"},{"@type":"Person","name":"Musco, Cameron","givenName":"Cameron","familyName":"Musco"},{"@type":"Person","name":"Parter, Merav","givenName":"Merav","familyName":"Parter"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.15","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9370","name":"Mutation, Sexual Reproduction and Survival in Dynamic Environments","abstract":"A new approach to understanding evolution [Valiant, JACM 2009], namely viewing it through the lens of computation,\r\nhas already started yielding new insights, e.g., natural selection under sexual reproduction can be interpreted\r\nas the Multiplicative Weight Update (MWU) Algorithm in coordination games played among genes [Chastain, Livnat, Papadimitriou, Vazirani, PNAS 2014]. Using this machinery, we study the role of mutation in changing environments in the presence of sexual reproduction. Following [Wolf, Vazirani, Arkin, J. Theor. Biology], we model changing environments via a Markov chain, with the states representing environments, each with its own fitness matrix. In this setting, we show that in the absence of mutation, the population goes extinct, but in the presence of mutation, the population survives with positive probability.\r\n\r\nOn the way to proving the above theorem, we need to establish some facts about dynamics in games. We provide the first, to our knowledge, polynomial convergence bound for noisy MWU in a coordination game. \r\nFinally, we also show that in static environments, sexual evolution with mutation converges, for any level of mutation.","keywords":["Evolution","Non-linear dynamics","Mutation"],"author":[{"@type":"Person","name":"Mehta, Ruta","givenName":"Ruta","familyName":"Mehta"},{"@type":"Person","name":"Panageas, Ioannis","givenName":"Ioannis","familyName":"Panageas"},{"@type":"Person","name":"Piliouras, Georgios","givenName":"Georgios","familyName":"Piliouras"},{"@type":"Person","name":"Tetali, Prasad","givenName":"Prasad","familyName":"Tetali"},{"@type":"Person","name":"Vazirani, Vijay V.","givenName":"Vijay V.","familyName":"Vazirani"}],"position":16,"pageStart":"16:1","pageEnd":"16:29","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Mehta, Ruta","givenName":"Ruta","familyName":"Mehta"},{"@type":"Person","name":"Panageas, Ioannis","givenName":"Ioannis","familyName":"Panageas"},{"@type":"Person","name":"Piliouras, Georgios","givenName":"Georgios","familyName":"Piliouras"},{"@type":"Person","name":"Tetali, Prasad","givenName":"Prasad","familyName":"Tetali"},{"@type":"Person","name":"Vazirani, Vijay V.","givenName":"Vijay V.","familyName":"Vazirani"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.16","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["http:\/\/www.offconvex.org","http:\/\/arxiv.org\/abs\/1411.6322"],"isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9371","name":"Self-Sustaining Iterated Learning","abstract":"An important result from psycholinguistics (Griffiths & Kalish, 2005) states that no language can be learned iteratively by rational agents in a self-sustaining manner. We show how to modify the learning process slightly in order to achieve self-sustainability. Our work is in two parts. First, we characterize iterated learnability in geometric terms and show how a slight, steady increase in the lengths of the training sessions ensures self-sustainability for any discrete language class. In the second part, we tackle the nondiscrete case and investigate self-sustainability for iterated linear regression. We discuss the implications of our findings to issues of non-equilibrium dynamics in natural algorithms.","keywords":["Iterated learning","language evolution","iterated Bayesian linear regression","non-equilibrium dynamics"],"author":[{"@type":"Person","name":"Chazelle, Bernard","givenName":"Bernard","familyName":"Chazelle"},{"@type":"Person","name":"Wang, Chu","givenName":"Chu","familyName":"Wang"}],"position":17,"pageStart":"17:1","pageEnd":"17:17","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Chazelle, Bernard","givenName":"Bernard","familyName":"Chazelle"},{"@type":"Person","name":"Wang, Chu","givenName":"Chu","familyName":"Wang"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.17","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9372","name":"Coding in Undirected Graphs Is Either Very Helpful or Not Helpful at All","abstract":"While it is known that using network coding can significantly improve the throughput of directed networks, it is a notorious open problem whether coding yields any advantage over the multicommodity flow (MCF) rate in undirected networks. It was conjectured that the answer is no. In this paper we show that even a small advantage over MCF can be amplified to yield a near-maximum possible gap. \r\n\r\nWe prove that any undirected network with k source-sink pairs that exhibits a (1+epsilon) gap between its MCF rate and its network coding rate can be used to construct a family of graphs G' whose gap is log(|G'|)^c for some constant c < 1. The resulting gap is close to the best currently known upper bound, log(|G'|), which follows from the connection between MCF and sparsest cuts. \r\n\r\nOur construction relies on a gap-amplifying graph tensor product that, given two graphs G1,G2 with small gaps, creates another graph G with a gap that is equal to the product of the previous two, at the cost of increasing the size of the graph. We iterate this process to obtain a gap of log(|G'|)^c from any initial gap.","keywords":["Network coding","Gap Amplification","Multicommodity flows"],"author":[{"@type":"Person","name":"Braverman, Mark","givenName":"Mark","familyName":"Braverman"},{"@type":"Person","name":"Garg, Sumegha","givenName":"Sumegha","familyName":"Garg"},{"@type":"Person","name":"Schvartzman, Ariel","givenName":"Ariel","familyName":"Schvartzman"}],"position":18,"pageStart":"18:1","pageEnd":"18:18","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Braverman, Mark","givenName":"Mark","familyName":"Braverman"},{"@type":"Person","name":"Garg, Sumegha","givenName":"Sumegha","familyName":"Garg"},{"@type":"Person","name":"Schvartzman, Ariel","givenName":"Ariel","familyName":"Schvartzman"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.18","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9373","name":"Compression in a Distributed Setting","abstract":"Motivated by an attempt to understand the formation and development of (human) language, we introduce a \"distributed compression\" problem. In our problem a sequence of pairs of players from a set of K players are chosen and tasked to communicate messages drawn from an unknown distribution Q. \r\nArguably languages are created and evolve to compress frequently occurring messages, and we focus on this aspect.\r\nThe only knowledge that players have about the distribution Q is from previously drawn samples, but these samples differ from player to player.\r\nThe only common knowledge between the players is restricted to a common prior distribution P and some constant number\r\nof bits of information (such as a learning algorithm). \r\nLetting T_epsilon denote the number of iterations it would take for a typical player\r\nto obtain an epsilon-approximation to Q in total variation distance, we ask\r\nwhether T_epsilon iterations suffice to compress the messages down roughly to their\r\nentropy and give a partial positive answer.\r\n\r\nWe show that a natural uniform algorithm can compress the communication down to an average cost per\r\nmessage of O(H(Q) + log (D(P || Q)) in tilde{O}(T_epsilon) iterations\r\nwhile allowing for O(epsilon)-error,\r\nwhere D(. || .) denotes the KL-divergence between distributions.\r\nFor large divergences\r\nthis compares favorably with the static algorithm that ignores all samples and\r\ncompresses down to H(Q) + D(P || Q) bits, while not requiring T_epsilon * K iterations that it would take players to develop optimal but separate compressions for \r\neach pair of players.\r\nAlong the way we introduce a \"data-structural\" view of the task of\r\ncommunicating with a natural language and show that our natural algorithm can also be\r\nimplemented by an efficient data structure, whose storage is comparable to the storage requirements of Q and whose query complexity is comparable to the lengths of the message to be\r\ncompressed.\r\nOur results give a plausible mathematical analogy to the mechanisms by which\r\nhuman languages get created and evolve, and in particular highlights the\r\npossibility of coordination towards a joint task (agreeing on a language)\r\nwhile engaging in distributed learning.","keywords":["Distributed Compression","Communication","Language Evolution","Isolating Hash Families"],"author":[{"@type":"Person","name":"Ghazi, Badih","givenName":"Badih","familyName":"Ghazi"},{"@type":"Person","name":"Haramaty, Elad","givenName":"Elad","familyName":"Haramaty"},{"@type":"Person","name":"Kamath, Pritish","givenName":"Pritish","familyName":"Kamath"},{"@type":"Person","name":"Sudan, Madhu","givenName":"Madhu","familyName":"Sudan"}],"position":19,"pageStart":"19:1","pageEnd":"19:22","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Ghazi, Badih","givenName":"Badih","familyName":"Ghazi"},{"@type":"Person","name":"Haramaty, Elad","givenName":"Elad","familyName":"Haramaty"},{"@type":"Person","name":"Kamath, Pritish","givenName":"Pritish","familyName":"Kamath"},{"@type":"Person","name":"Sudan, Madhu","givenName":"Madhu","familyName":"Sudan"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.19","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9374","name":"Outlaw Distributions and Locally Decodable Codes","abstract":"Locally decodable codes (LDCs) are error correcting codes that allow for decoding of a single message bit using a small number of queries to a corrupted encoding. Despite decades of study, the optimal trade-off between query complexity and codeword length is far from understood. In this work, we give a new characterization of LDCs using distributions over Boolean functions whose expectation is hard to approximate (in L_\\infty norm) with a small number of samples. We coin the term 'outlaw distributions' for such distributions since they 'defy' the Law of Large Numbers. We show that the existence of outlaw distributions over sufficiently \r\n'smooth' functions implies the existence of constant query LDCs and vice versa. We give several candidates for outlaw distributions over smooth functions coming from finite field incidence geometry and from hypergraph (non)expanders.\r\n\r\nWe also prove a useful lemma showing that (smooth) LDCs which are only required to work on average over a random message and a random message index can be turned into true LDCs at the cost of only constant factors in the parameters.","keywords":["Locally Decodable Code","VC-dimension","Incidence Geometry","Cayley Hypergraphs"],"author":[{"@type":"Person","name":"Bri\u00ebt, Jop","givenName":"Jop","familyName":"Bri\u00ebt"},{"@type":"Person","name":"Dvir, Zeev","givenName":"Zeev","familyName":"Dvir"},{"@type":"Person","name":"Gopi, Sivakanth","givenName":"Sivakanth","familyName":"Gopi"}],"position":20,"pageStart":"20:1","pageEnd":"20:19","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Bri\u00ebt, Jop","givenName":"Jop","familyName":"Bri\u00ebt"},{"@type":"Person","name":"Dvir, Zeev","givenName":"Zeev","familyName":"Dvir"},{"@type":"Person","name":"Gopi, Sivakanth","givenName":"Sivakanth","familyName":"Gopi"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.20","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["http:\/\/citeseer.ist.psu.edu\/alon97random.html","http:\/\/dx.doi.org\/10.1109\/TIT.2012.2208937","http:\/\/dx.doi.org\/10.1145\/2897518.2897523","http:\/\/dx.doi.org\/10.1002\/j.1538-7305.1948.tb01338.x","http:\/\/dx.doi.org\/10.1007\/s11390-012-1254-8"],"isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9375","name":"Constant-Rate Interactive Coding Is Impossible, Even In Constant-Degree Networks","abstract":"Multiparty interactive coding allows a network of n parties to perform distributed computations when the communication channels suffer from noise. Previous results (Rajagopalan and Schulman, STOC\u201994) obtained a multiparty interactive coding protocol, resilient to random noise, with a blowup of O(log(\\Delta + 1)) for networks whose topology has a maximal degree \\Delta. Vitally, the communication model in their work forces all the parties to send one message at every round of the protocol, even if they have nothing to send.\r\n\r\nWe re-examine the question of multiparty interactive coding, lifting the requirement that forces all the parties to communicate at each and every round. We use the recently developed information-theoretic machinery of Braverman et al. (STOC \u201916) to show that if the network\u2019s topology is a cycle, then there is a specific \u201ccycle task\u201d for which any coding scheme has a communication blowup of \\Omega(log n). This is quite surprising since the cycle has a maximal degree of \\Delta = 2, implying a coding with a constant blowup when all parties are forced to speak at all rounds.\r\n\r\nWe complement our lower bound with a matching coding scheme for the \"cycle task\" that has a communication blowup of \\Omega(log n). This makes our lower bound for the cycle task tight.","keywords":["Interactive Communication","Coding","Stochastic Noise","Communication Complexity"],"author":[{"@type":"Person","name":"Gelles, Ran","givenName":"Ran","familyName":"Gelles"},{"@type":"Person","name":"T. Kalai, Yael","givenName":"Yael","familyName":"T. Kalai"}],"position":21,"pageStart":"21:1","pageEnd":"21:13","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Gelles, Ran","givenName":"Ran","familyName":"Gelles"},{"@type":"Person","name":"T. Kalai, Yael","givenName":"Yael","familyName":"T. Kalai"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.21","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9376","name":"Parallel Repetition via Fortification: Analytic View and the Quantum Case","abstract":"In a recent work, Moshkovitz [FOCS'14] presented a transformation n two-player games called \"fortification\", and gave an elementary proof of an (exponential decay) parallel repetition theorem for fortified two-player projection games. In this paper, we give an analytic reformulation of Moshkovitz's fortification framework, which was originally cast in combinatorial terms. This reformulation allows us to expand the scope of the fortification method to new settings.\r\n\r\nFirst, we show any game (not just projection games) can be fortified, and give a simple proof of parallel repetition for general fortified games. Then, we prove parallel repetition and fortification theorems for games with players sharing quantum entanglement, as well as games with more than two players. This gives a new gap amplification method for general games in the quantum and multiplayer settings, which has recently received much interest.\r\n\r\nAn important component of our work is a variant of the fortification transformation, called \"ordered fortification\", that preserves the entangled value of a game. The original fortification of Moshkovitz does not in general preserve the entangled value of a game, and this was a barrier to extending the fortification framework to the quantum setting.","keywords":["Parallel repetition","quantum entanglement","non-local games"],"author":[{"@type":"Person","name":"Bavarian, Mohammad","givenName":"Mohammad","familyName":"Bavarian"},{"@type":"Person","name":"Vidick, Thomas","givenName":"Thomas","familyName":"Vidick"},{"@type":"Person","name":"Yuen, Henry","givenName":"Henry","familyName":"Yuen"}],"position":22,"pageStart":"22:1","pageEnd":"22:33","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Bavarian, Mohammad","givenName":"Mohammad","familyName":"Bavarian"},{"@type":"Person","name":"Vidick, Thomas","givenName":"Thomas","familyName":"Vidick"},{"@type":"Person","name":"Yuen, Henry","givenName":"Henry","familyName":"Yuen"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.22","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9377","name":"The Classification of Reversible Bit Operations","abstract":"We present a complete classification of all possible sets of classical reversible gates acting on bits, in terms of which reversible transformations they generate, assuming swaps and ancilla bits are available for free. Our classification can be seen as the reversible-computing analogue of Post's lattice, a central result in mathematical logic from the 1940s. It is a step toward the ambitious goal of classifying all possible quantum gate sets acting on qubits.\r\n\r\nOur theorem implies a linear-time algorithm (which we have implemented), that takes as input the truth tables of reversible gates G and H, and that decides whether G generates H. Previously, this problem was not even known to be decidable (though with effort, one can derive from abstract considerations an algorithm that takes triply-exponential time). The theorem also implies that any n-bit reversible circuit can be \"compressed\" to an equivalent circuit, over the same gates, that uses at most 2^{n}poly(n) gates and O(1) ancilla bits; these are the first upper bounds on these quantities known, and are close to optimal. Finally, the theorem implies that every non-degenerate reversible gate can implement either every reversible transformation, or every affine transformation, when restricted to an \"encoded subspace.\"\r\n\r\nBriefly, the theorem says that every set of reversible gates generates either all reversible transformations on n-bit strings (as the Toffoli gate does); no transformations; all transformations that preserve Hamming weight (as the Fredkin gate does); all transformations that preserve Hamming weight mod k for some k; all affine transformations (as the Controlled-NOT gate does); all affine transformations that preserve Hamming weight mod 2 or mod 4, inner products mod 2, or a combination thereof; or a previous class augmented by a NOT or NOTNOT gate. Prior to this work, it was not even known that every class was finitely generated. Ruling out the possibility of additional classes, not in the list, requires involved arguments about polynomials, lattices, and Diophantine equations.","keywords":["Reversible computation","Reversible gates","Circuit synthesis","Gate classification","Boolean logic","Post\u2019s lattice"],"author":[{"@type":"Person","name":"Aaronson, Scott","givenName":"Scott","familyName":"Aaronson"},{"@type":"Person","name":"Grier, Daniel","givenName":"Daniel","familyName":"Grier"},{"@type":"Person","name":"Schaeffer, Luke","givenName":"Luke","familyName":"Schaeffer"}],"position":23,"pageStart":"23:1","pageEnd":"23:34","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Aaronson, Scott","givenName":"Scott","familyName":"Aaronson"},{"@type":"Person","name":"Grier, Daniel","givenName":"Daniel","familyName":"Grier"},{"@type":"Person","name":"Schaeffer, Luke","givenName":"Luke","familyName":"Schaeffer"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.23","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["http:\/\/arxiv.org\/abs\/1606.00804","http:\/\/cstheory.stackexchange.com\/questions\/25730\/classifying-reversible-gates","http:\/\/www.math.vanderbilt.edu\/~msapir\/ftp\/pub\/survey\/survey.pdf","https:\/\/github.com\/lrschaeffer\/Gate-Classifier","http:\/\/arxiv.org\/abs\/1506.03777"],"isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9378","name":"Nondeterministic Quantum Communication Complexity: the Cyclic Equality Game and Iterated Matrix Multiplication","abstract":"We study nondeterministic multiparty quantum communication with a quantum generalization of broadcasts. We show that, with number-in-hand classical inputs, the communication complexity of a Boolean function in this communication model equals the logarithm of the support rank of the corresponding tensor, whereas the approximation complexity in this model equals the logarithm of the border support rank. This characterisation allows us to prove a log-rank conjecture posed by Villagra et al. for nondeterministic multiparty quantum communication with message passing.\r\nThe support rank characterization of the communication model connects quantum communication complexity intimately to the theory of asymptotic entanglement transformation and algebraic complexity theory. In this context, we introduce the graphwise equality problem. For a cycle graph, the complexity of this communication problem is closely related to the complexity of the computational problem of multiplying matrices, or more precisely, it equals the logarithm of the support rank of the iterated matrix multiplication tensor. We employ Strassen\u2019s laser method to show that asymptotically there exist nontrivial protocols for every odd-player cyclic equality problem. We exhibit an efficient protocol for the 5-player problem for small inputs, and we show how Young flattenings yield nontrivial complexity lower bounds.","keywords":["quantum communication complexity","broadcast channel","number-in-hand","matrix multiplication","support rank"],"author":[{"@type":"Person","name":"Buhrman, Harry","givenName":"Harry","familyName":"Buhrman"},{"@type":"Person","name":"Christandl, Matthias","givenName":"Matthias","familyName":"Christandl"},{"@type":"Person","name":"Zuiddam, Jeroen","givenName":"Jeroen","familyName":"Zuiddam"}],"position":24,"pageStart":"24:1","pageEnd":"24:18","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Buhrman, Harry","givenName":"Harry","familyName":"Buhrman"},{"@type":"Person","name":"Christandl, Matthias","givenName":"Matthias","familyName":"Christandl"},{"@type":"Person","name":"Zuiddam, Jeroen","givenName":"Jeroen","familyName":"Zuiddam"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.24","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["http:\/\/dx.doi.org\/10.1109\/CCC.2004.1313848","http:\/\/dx.doi.org\/10.1137\/0221006","http:\/\/arxiv.org\/abs\/1503.04486","http:\/\/dx.doi.org\/10.1007\/3-540-44679-6_1","http:\/\/dx.doi.org\/10.4086\/toc.gs.2013.005","http:\/\/dx.doi.org\/10.1007\/978-3-662-03338-8","http:\/\/dx.doi.org\/10.1103\/PhysRevLett.101.140502","http:\/\/arxiv.org\/abs\/1606.04085","http:\/\/arxiv.org\/abs\/1207.6528","http:\/\/dx.doi.org\/10.1016\/j.jalgebra.2016.04.028","http:\/\/nbn-resolving.de\/urn:nbn:de:hbz:466:2-10472","http:\/\/arxiv.org\/abs\/1601.08229","http:\/\/dx.doi.org\/10.4086\/toc.2015.v011a011","http:\/\/dx.doi.org\/10.1145\/2608628.2608664","http:\/\/dx.doi.org\/10.1137\/0210032","http:\/\/dx.doi.org\/10.1007\/BF02165411","http:\/\/dx.doi.org\/10.1016\/0024-3795(83)80041-X","http:\/\/dx.doi.org\/10.1007\/978-3-642-29952-0_39","http:\/\/arxiv.org\/abs\/1603.03964","http:\/\/dx.doi.org\/10.1137\/S0097539702407345"],"isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9379","name":"Quantum Codes from High-Dimensional Manifolds","abstract":"We construct toric codes on various high-dimensional manifolds. Assuming a conjecture in geometry we find families of \r\nquantum CSS stabilizer codes on N qubits with logarithmic weight stabilizers and distance N^{1-\\epsilon} for any \\epsilon>0.\r\nThe conjecture is that there is a constant C>0 such that for any n-dimensional torus {\\mathbb T}^n={\\mathbb R}^n\/\\Lambda, where \\Lambda is a lattice, the least volume unoriented n\/2-dimensional cycle (using the Euclidean metric) representing nontrivial homology has volume at least C^n times the volume of the least volume n\/2-dimensional hyperplane representing nontrivial homology; in fact, it would suffice to have this result for \\Lambda an integral lattice with the cycle restricted to faces of a cubulation by unit hypercubes.\r\nThe main technical result is an estimate of Rankin invariants for certain random lattices, showing that in a certain sense they are optimal.\r\nAdditionally, we construct codes with square-root distance, logarithmic weight stabilizers, and inverse polylogarithmic soundness factor (considered as quantum locally testable codes.\r\nWe also provide an short, alternative proof that the shortest vector in the exterior power of a lattice may be non-split.","keywords":["quantum codes","random lattices","Rankin invariants"],"author":{"@type":"Person","name":"Hastings, Matthew B.","givenName":"Matthew B.","familyName":"Hastings"},"position":25,"pageStart":"25:1","pageEnd":"25:26","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":{"@type":"Person","name":"Hastings, Matthew B.","givenName":"Matthew B.","familyName":"Hastings"},"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.25","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["http:\/\/dx.doi.org\/10.1016\/S0012-9593(99)80003-2","http:\/\/dx.doi.org\/10.1063\/1.2731356","http:\/\/dx.doi.org\/10.1103\/physreva.54.1098","http:\/\/www.encyclopediaofmath.org\/index.php?title=Federer-Fleming_deformation_theorem&oldid=28190","http:\/\/dx.doi.org\/10.1007\/s102080010013","http:\/\/dx.doi.org\/10.1016\/s0003-4916(02)00018-0"],"isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9380","name":"Conditional Hardness for Sensitivity Problems","abstract":"In recent years it has become popular to study dynamic problems in a sensitivity setting: Instead of allowing for an arbitrary sequence of updates, the sensitivity model only allows to apply batch updates of small size to the original input data. The sensitivity model is particularly appealing since recent strong conditional lower bounds ruled out fast algorithms for many dynamic problems, such as shortest paths, reachability, or subgraph connectivity.\r\n\r\nIn this paper we prove conditional lower bounds for these and additional problems in a sensitivity setting. For example, we show that under the Boolean Matrix Multiplication (BMM) conjecture combinatorial algorithms cannot compute the (4\/3-\\varepsilon)-approximate diameter of an undirected unweighted dense graph with truly subcubic preprocessing time and truly subquadratic update\/query time. This result is surprising since in the static setting it is not clear whether a reduction from BMM to diameter is possible. We further show under the BMM conjecture that many problems, such as reachability or approximate shortest paths, cannot be solved faster than by recomputation from scratch even after only one or two edge insertions. We extend our reduction from BMM to Diameter to give a reduction from All Pairs Shortest Paths to Diameter under one deletion in weighted graphs. This is intriguing, as in the static setting it is a big open problem whether Diameter is as hard as APSP. We further get a nearly tight lower bound for shortest paths after two edge deletions based on the APSP conjecture. We give more lower bounds under the Strong Exponential Time Hypothesis. Many of our lower bounds also hold for static oracle data structures where no sensitivity is required.\r\n\r\nFinally, we give the first algorithm for the (1+\\varepsilon)-approximate radius, diameter, and eccentricity problems in directed or undirected unweighted graphs in case of single edges failures. The algorithm has a truly subcubic running time for graphs with a truly subquadratic number of edges; it is tight w.r.t. the conditional lower bounds we obtain.","keywords":["sensitivity","conditional lower bounds","data structures","dynamic graph algorithms"],"author":[{"@type":"Person","name":"Henzinger, Monika","givenName":"Monika","familyName":"Henzinger"},{"@type":"Person","name":"Lincoln, Andrea","givenName":"Andrea","familyName":"Lincoln"},{"@type":"Person","name":"Neumann, Stefan","givenName":"Stefan","familyName":"Neumann"},{"@type":"Person","name":"Vassilevska Williams, Virginia","givenName":"Virginia","familyName":"Vassilevska Williams"}],"position":26,"pageStart":"26:1","pageEnd":"26:31","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Henzinger, Monika","givenName":"Monika","familyName":"Henzinger"},{"@type":"Person","name":"Lincoln, Andrea","givenName":"Andrea","familyName":"Lincoln"},{"@type":"Person","name":"Neumann, Stefan","givenName":"Stefan","familyName":"Neumann"},{"@type":"Person","name":"Vassilevska Williams, Virginia","givenName":"Virginia","familyName":"Vassilevska Williams"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.26","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9381","name":"An Improved Homomorphism Preservation Theorem From Lower Bounds in Circuit Complexity","abstract":"Previous work of the author [Rossmann'08] showed that the Homomorphism Preservation Theorem of classical model theory remains valid when its statement is restricted to finite structures. In this paper, we give a new proof of this result via a reduction to lower bounds in circuit complexity, specifically on the AC0 formula size of the colored subgraph isomorphism problem. Formally, we show the following: if a first-order sentence of quantifier-rank k is preserved under homomorphisms on finite structures, then it is equivalent on finite structures to an existential-positive sentence of quantifier-rank poly(k). Quantitatively, this improves the result of [Rossmann'08], where the upper bound on quantifier-rank is a non-elementary function of k.","keywords":["circuit complexity","finite model theory"],"author":{"@type":"Person","name":"Rossman, Benjamin","givenName":"Benjamin","familyName":"Rossman"},"position":27,"pageStart":"27:1","pageEnd":"27:17","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":{"@type":"Person","name":"Rossman, Benjamin","givenName":"Benjamin","familyName":"Rossman"},"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.27","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9382","name":"Low-Sensitivity Functions from Unambiguous Certificates","abstract":"We provide new query complexity separations against sensitivity for total Boolean functions: a power 3 separation between deterministic (and even randomized or quantum) query complexity and sensitivity, and a power 2.22 separation between certificate complexity and sensitivity. We get these separations by using a new connection between sensitivity and a seemingly unrelated measure called one-sided unambiguous certificate complexity. We also show that one-sided unambiguous certificate complexity is lower-bounded by fractional block sensitivity, which means we cannot use these techniques to get a super-quadratic separation between block sensitivity and sensitivity.\r\n \r\nAlong the way, we give a power 1.22 separation between certificate complexity and one-sided unambiguous certificate complexity, improving the power 1.128 separation due to Goos [FOCS 2015]. As a consequence, we obtain an improved lower-bound on the co-nondeterministic communication complexity of the Clique vs. Independent Set problem.","keywords":["Boolean functions","decision tree complexity","query complexity","sensitivity conjecture"],"author":[{"@type":"Person","name":"Ben-David, Shalev","givenName":"Shalev","familyName":"Ben-David"},{"@type":"Person","name":"Hatami, Pooya","givenName":"Pooya","familyName":"Hatami"},{"@type":"Person","name":"Tal, Avishay","givenName":"Avishay","familyName":"Tal"}],"position":28,"pageStart":"28:1","pageEnd":"28:23","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Ben-David, Shalev","givenName":"Shalev","familyName":"Ben-David"},{"@type":"Person","name":"Hatami, Pooya","givenName":"Pooya","familyName":"Hatami"},{"@type":"Person","name":"Tal, Avishay","givenName":"Avishay","familyName":"Tal"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.28","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["http:\/\/dx.doi.org\/10.1016\/j.jcss.2007.06.020","http:\/\/arxiv.org\/abs\/1511.01937","http:\/\/dx.doi.org\/10.1007\/978-3-662-43948-7_9","http:\/\/dx.doi.org\/10.4230\/LIPIcs.CCC.2016.4","http:\/\/dx.doi.org\/10.1007\/978-3-662-44465-8_4","http:\/\/arxiv.org\/abs\/1503.07691","http:\/\/arxiv.org\/abs\/1108.3494","http:\/\/dx.doi.org\/10.1007\/978-3-319-17142-5_12","http:\/\/dx.doi.org\/10.1145\/502090.502097","http:\/\/dx.doi.org\/10.1007\/11611257_13","http:\/\/arxiv.org\/abs\/1207.1824","http:\/\/dx.doi.org\/10.1109\/12.45216","http:\/\/dx.doi.org\/10.1016\/S0304-3975(01)00144-X","http:\/\/dx.doi.org\/10.1016\/j.tcs.2016.05.006","http:\/\/dx.doi.org\/10.1007\/3-540-45726-7_9","http:\/\/dx.doi.org\/10.1145\/2688073.2688096","http:\/\/dx.doi.org\/10.1007\/s00493-014-3189-x","http:\/\/dx.doi.org\/10.1109\/FOCS.2015.69","http:\/\/eccc.hpi-web.de\/report\/2015\/169\/","http:\/\/dx.doi.org\/10.1109\/FOCS.2015.70","http:\/\/dx.doi.org\/10.1145\/2840728.2840738","http:\/\/arxiv.org\/abs\/1604.07432","http:\/\/dx.doi.org\/10.4086\/toc.gs.2011.004","http:\/\/dx.doi.org\/10.4230\/LIPIcs.APPROX-RANDOM.2015.915","http:\/\/dx.doi.org\/10.1109\/FOCS.2011.75","http:\/\/arxiv.org\/abs\/quant-ph\/0403168","http:\/\/dx.doi.org\/10.1137\/0220062","http:\/\/dx.doi.org\/10.1137\/1.9781611973082.44","http:\/\/dx.doi.org\/10.1109\/SFCS.1986.44","http:\/\/eccc.hpi-web.de\/report\/2002\/009\/","http:\/\/arxiv.org\/abs\/1506.06456","http:\/\/dx.doi.org\/10.1145\/2422436.2422485","http:\/\/dx.doi.org\/10.1016\/0022-0000(91)90024-Y"],"isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9383","name":"Testing k-Monotonicity","abstract":"A Boolean k-monotone function defined over a finite poset domain D alternates between the values 0 and 1 at most k times on any ascending chain in D. Therefore, k-monotone functions are natural generalizations of the classical monotone functions, which are the 1-monotone functions.\r\n\r\nMotivated by the recent interest in k-monotone functions in the context of circuit complexity and learning theory, and by the central role that monotonicity testing plays in the context of property testing, we initiate a systematic study of k-monotone functions, in the property testing model. In this model, the goal is to distinguish functions that are k-monotone (or are close to being k-monotone) from functions that are far from being k-monotone. \r\n\r\nOur results include the following:\r\n\r\n1. We demonstrate a separation between testing k-monotonicity and testing monotonicity, on the hypercube domain {0,1}^d, for k >= 3;\r\n2. We demonstrate a separation between testing and learning on {0,1}^d, for k=\\omega(\\log d): testing k-monotonicity can be performed with 2^{O(\\sqrt d . \\log d . \\log{1\/\\eps})} queries, while learning k-monotone functions requires 2^{\\Omega(k . \\sqrt d .{1\/\\eps})} queries (Blais et al. (RANDOM 2015)).\r\n3. We present a tolerant test for functions f\\colon[n]^d\\to \\{0,1\\}$with complexity independent of n, which makes progress on a problem left open by Berman et al. (STOC 2014). \r\n\r\nOur techniques exploit the testing-by-learning paradigm, use novel applications of Fourier analysis on the grid [n]^d, and draw connections to distribution testing techniques.\r\n\r\n Our techniques exploit the testing-by-learning paradigm, use novel applications of Fourier analysis on the grid [n]^d, and draw connections to distribution testing techniques.","keywords":["Boolean Functions","Learning","Monotonicity","Property Testing"],"author":[{"@type":"Person","name":"Canonne, Cl\u00e9ment L.","givenName":"Cl\u00e9ment L.","familyName":"Canonne"},{"@type":"Person","name":"Grigorescu, Elena","givenName":"Elena","familyName":"Grigorescu"},{"@type":"Person","name":"Guo, Siyao","givenName":"Siyao","familyName":"Guo"},{"@type":"Person","name":"Kumar, Akash","givenName":"Akash","familyName":"Kumar"},{"@type":"Person","name":"Wimmer, Karl","givenName":"Karl","familyName":"Wimmer"}],"position":29,"pageStart":"29:1","pageEnd":"29:21","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Canonne, Cl\u00e9ment L.","givenName":"Cl\u00e9ment L.","familyName":"Canonne"},{"@type":"Person","name":"Grigorescu, Elena","givenName":"Elena","familyName":"Grigorescu"},{"@type":"Person","name":"Guo, Siyao","givenName":"Siyao","familyName":"Guo"},{"@type":"Person","name":"Kumar, Akash","givenName":"Akash","familyName":"Kumar"},{"@type":"Person","name":"Wimmer, Karl","givenName":"Karl","familyName":"Wimmer"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.29","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":"http:\/\/sublinear.info\/70","isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9384","name":"What Circuit Classes Can Be Learned with Non-Trivial Savings?","abstract":"Despite decades of intensive research, efficient - or even sub-exponential time - distribution-free PAC learning algorithms are not known for many important Boolean function classes. In this work we suggest a new perspective on these learning problems, inspired by a surge of recent research in complexity theory, in which the goal is to determine whether and how much of a savings over a naive 2^n runtime can be achieved.\r\n\r\nWe establish a range of exploratory results towards this end. In more detail, \r\n\r\n(1) We first observe that a simple approach building on known uniform-distribution learning results gives non-trivial distribution-free learning algorithms for several well-studied classes including AC0, arbitrary functions of a few linear threshold functions (LTFs), and AC0 augmented with mod_p gates.\r\n\r\n(2) Next we present an approach, based on the method of random restrictions from circuit complexity, which can be used to obtain several distribution-free learning algorithms that do not appear to be achievable by approach (1) above. The results achieved in this way include learning algorithms with non-trivial savings for LTF-of-AC0 circuits and improved savings for learning parity-of-AC0 circuits. \r\n\r\n(3) Finally, our third contribution is a generic technique for converting lower bounds proved using Neciporuk's method to learning algorithms with non-trivial savings. This technique, which is the most involved of our three approaches, yields distribution-free learning algorithms for a range of classes where previously even non-trivial uniform-distribution learning algorithms were not known; these classes include full-basis formulas, branching programs, span programs, etc. up to some fixed polynomial size.","keywords":["computational learning theory","circuit complexity","non-trivial savings"],"author":[{"@type":"Person","name":"Servedio, Rocco A.","givenName":"Rocco A.","familyName":"Servedio"},{"@type":"Person","name":"Tan, Li-Yang","givenName":"Li-Yang","familyName":"Tan"}],"position":30,"pageStart":"30:1","pageEnd":"30:21","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Servedio, Rocco A.","givenName":"Rocco A.","familyName":"Servedio"},{"@type":"Person","name":"Tan, Li-Yang","givenName":"Li-Yang","familyName":"Tan"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.30","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["http:\/\/dx.doi.org\/http:\/\/dx.doi.org\/10.4230\/LIPIcs.CCC.2016.10","http:\/\/dx.doi.org\/10.1109\/SCT.1993.336536","http:\/\/dx.doi.org\/10.1145\/1066100.1066101","http:\/\/eccc.hpi-web.de\/report\/2014\/174\/"],"isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9385","name":"Expander Construction in VNC1","abstract":"We give a combinatorial analysis (using edge expansion) of a variant of the iterative expander construction due to Reingold, Vadhan, and Wigderson (2002), and show that this analysis can be formalized in the bounded arithmetic system VNC^1 (corresponding to the \"NC^1 reasoning\"). As a corollary, we prove the assumption made by Jerabek (2011) that a construction of certain bipartite expander graphs can be formalized in VNC^1. This in turn implies that every proof in Gentzen's sequent calculus LK of a monotone sequent can be simulated in the monotone version of LK (MLK) with only polynomial blowup in proof size, strengthening the quasipolynomial simulation result of Atserias, Galesi, and Pudlak (2002).","keywords":["expander graphs","bounded arithmetic","alternating log time","sequent calculus","monotone propositional logic"],"author":[{"@type":"Person","name":"Buss, Sam","givenName":"Sam","familyName":"Buss"},{"@type":"Person","name":"Kabanets, Valentine","givenName":"Valentine","familyName":"Kabanets"},{"@type":"Person","name":"Kolokolova, Antonina","givenName":"Antonina","familyName":"Kolokolova"},{"@type":"Person","name":"Koucky, Michal","givenName":"Michal","familyName":"Koucky"}],"position":31,"pageStart":"31:1","pageEnd":"31:26","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Buss, Sam","givenName":"Sam","familyName":"Buss"},{"@type":"Person","name":"Kabanets, Valentine","givenName":"Valentine","familyName":"Kabanets"},{"@type":"Person","name":"Kolokolova, Antonina","givenName":"Antonina","familyName":"Kolokolova"},{"@type":"Person","name":"Koucky, Michal","givenName":"Michal","familyName":"Koucky"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.31","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["http:\/\/dx.doi.org\/10.1017\/S0963548307008851","http:\/\/dx.doi.org\/10.1016\/S0022-0000(02)00020-X","http:\/\/eccc.hpi-web.de\/report\/2016\/144\/","http:\/\/dx.doi.org\/10.1145\/1236457.1236459","http:\/\/dx.doi.org\/10.1016\/j.apal.2008.10.005","http:\/\/dx.doi.org\/10.1007\/BF01840378","http:\/\/dx.doi.org\/10.1145\/1391289.1391291","http:\/\/dx.doi.org\/10.1007\/s00453-007-9025-6"],"isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9386","name":"Finding Clearing Payments in Financial Networks with Credit Default Swaps is PPAD-complete","abstract":"We consider the problem of clearing a system of interconnected banks that have been exposed to a shock on their assets. Eisenberg and Noe (2001) showed that when banks can only enter into simple debt contracts with each other, then a clearing vector of payments can be computed in polynomial time. In this paper, we show that the situation changes radically when banks can also enter into credit default swaps (CDSs), i.e., financial derivative contracts that depend on the default of another bank. We prove that computing an approximate solution to the clearing problem with sufficiently small constant error is PPAD-complete. To do this, we demonstrate how financial networks with debt and CDSs can encode arithmetic operations such as addition and multiplication. Our results have practical impact for network stress tests and reveal computational complexity as a new concern regarding the stability of the financial system.","keywords":["Financial Networks","Credit Default Swaps","Clearing Systems","Arithmetic Circuits","PPAD"],"author":[{"@type":"Person","name":"Schuldenzucker, Steffen","givenName":"Steffen","familyName":"Schuldenzucker"},{"@type":"Person","name":"Seuken, Sven","givenName":"Sven","familyName":"Seuken"},{"@type":"Person","name":"Battiston, Stefano","givenName":"Stefano","familyName":"Battiston"}],"position":32,"pageStart":"32:1","pageEnd":"32:20","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Schuldenzucker, Steffen","givenName":"Steffen","familyName":"Schuldenzucker"},{"@type":"Person","name":"Seuken, Sven","givenName":"Sven","familyName":"Seuken"},{"@type":"Person","name":"Battiston, Stefano","givenName":"Stefano","familyName":"Battiston"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.32","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["http:\/\/dx.doi.org\/10.1126\/science.aad0299","http:\/\/dx.doi.org\/10.1109\/FOCS.2006.20","http:\/\/dx.doi.org\/10.1145\/1461928.1461951","http:\/\/dx.doi.org\/10.1257\/aer.104.10.3115","http:\/\/arxiv.org\/abs\/1503.07676","http:\/\/dx.doi.org\/10.1016\/S0022-0000(05)80063-7","http:\/\/dx.doi.org\/10.1145\/2746539.2746578","http:\/\/www.ifi.uzh.ch\/ce\/publications\/Clearing_CDSs.pdf","http:\/\/www.ifi.uzh.ch\/ce\/publications\/Clearing_PPAD.pdf"],"isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9387","name":"Testing Submodularity and Other Properties of Valuation Functions","abstract":"We show that for any constant \\epsilon > 0 and p \\ge 1, it is possible to distinguish functions f : \\{0,1\\}^n \\to [0,1] that are submodular from those that are \\epsilon-far from every submodular function in \\ell_p distance with a constant number of queries. \r\n\t\t\r\nMore generally, we extend the testing-by-implicit-learning framework of Diakonikolas et al.(2007) to show that every property of real-valued functions that is well-approximated in \\ell_2 distance by a class of k-juntas for some k = O(1) can be tested in the \\ell_p-testing model with a constant number of queries. This result, combined with a recent junta theorem of Feldman and \\Vondrak (2016), yields the constant-query testability of submodularity. It also yields constant-query testing algorithms for a variety of other natural properties of valuation functions, including fractionally additive (XOS) functions, OXS functions, unit demand functions, coverage functions, and self-bounding functions.","keywords":["Property testing","Testing by implicit learning","Self-bounding functions"],"author":[{"@type":"Person","name":"Blais, Eric","givenName":"Eric","familyName":"Blais"},{"@type":"Person","name":"Bommireddi, Abhinav","givenName":"Abhinav","familyName":"Bommireddi"}],"position":33,"pageStart":"33:1","pageEnd":"33:17","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Blais, Eric","givenName":"Eric","familyName":"Blais"},{"@type":"Person","name":"Bommireddi, Abhinav","givenName":"Abhinav","familyName":"Bommireddi"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.33","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["http:\/\/portal.acm.org\/citation.cfm?id=2095197&CFID=63838676&CFTOKEN=79617016","http:\/\/www.jmlr.org\/proceedings\/papers\/v23\/balcan12b\/balcan12b.pdf","http:\/\/dx.doi.org\/10.1145\/1993636.1993741","http:\/\/dx.doi.org\/10.1145\/2591796.2591887","http:\/\/dx.doi.org\/10.1145\/1536414.1536437","http:\/\/dx.doi.org\/10.1137\/140971877","http:\/\/dx.doi.org\/10.1016\/0022-0000(93)90044-W","http:\/\/dx.doi.org\/10.1137\/140964072","http:\/\/dx.doi.org\/10.1007\/978-3-642-22006-7_46","http:\/\/dx.doi.org\/10.1109\/FOCS.2007.32","http:\/\/dx.doi.org\/10.1007\/978-3-540-70575-8_41","http:\/\/dx.doi.org\/10.1137\/070680977","http:\/\/dx.doi.org\/10.1137\/090779346","http:\/\/jmlr.org\/proceedings\/papers\/v35\/feldman14a.html","http:\/\/dx.doi.org\/10.1109\/FOCS.2015.61","http:\/\/dx.doi.org\/10.1137\/140958207","http:\/\/dx.doi.org\/10.1016\/j.jcss.2003.11.004","http:\/\/dx.doi.org\/10.1080\/01621459.1977.10480637","http:\/\/dx.doi.org\/10.1007\/s00493-008-2318-9","http:\/\/dx.doi.org\/10.1145\/285055.285060","http:\/\/dx.doi.org\/10.1137\/100785429","http:\/\/dx.doi.org\/10.1137\/0222080","http:\/\/dx.doi.org\/10.1016\/j.geb.2005.02.006","http:\/\/dx.doi.org\/10.1137\/070707890","http:\/\/www.cambridge.org\/de\/academic\/subjects\/computer-science\/algorithmics-complexity-computer-algebra-and-computational-g\/analysis-boolean-functions","http:\/\/epubs.siam.org\/sam-bin\/dbq\/article\/40744","http:\/\/dx.doi.org\/10.1137\/S0097539793255151","http:\/\/dx.doi.org\/10.1007\/978-3-642-16367-8_11","http:\/\/conference.itcs.tsinghua.edu.cn\/ICS2011\/content\/papers\/21.html","http:\/\/dx.doi.org\/10.1007\/978-3-642-39206-1_71"],"isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9388","name":"Algorithmic Aspects of Private Bayesian Persuasion","abstract":"We consider a multi-receivers Bayesian persuasion model where an informed sender tries to persuade a group of receivers to take a certain action. The state of nature is known to the sender, but it is unknown to the receivers. The sender is allowed to commit to a signaling policy where she sends a private signal to every receiver. This work studies the computation aspects of finding a signaling policy that maximizes the sender's revenue. \r\n\r\nWe show that if the sender's utility is a submodular function of the set of receivers that take the desired action, then we can efficiently find a signaling policy whose revenue is at least (1-1\/e) times the optimal. We also prove that approximating the sender's optimal revenue by a factor better than (1-1\/e) is NP-hard and, hence, the developed approximation guarantee is essentially tight. When the sender's utility is a function of the number of receivers that take the desired action (i.e., the utility function is anonymous), we show that an optimal signaling policy can be computed in polynomial time. Our results are based on an interesting connection between the Bayesian persuasion problem and the evaluation of the concave closure of a set function.","keywords":["Economics of Information","Bayesian Persuasion","Signaling","Concave Closure"],"author":[{"@type":"Person","name":"Babichenko, Yakov","givenName":"Yakov","familyName":"Babichenko"},{"@type":"Person","name":"Barman, Siddharth","givenName":"Siddharth","familyName":"Barman"}],"position":34,"pageStart":"34:1","pageEnd":"34:16","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Babichenko, Yakov","givenName":"Yakov","familyName":"Babichenko"},{"@type":"Person","name":"Barman, Siddharth","givenName":"Siddharth","familyName":"Barman"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.34","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9389","name":"Condorcet-Consistent and Approximately Strategyproof Tournament Rules","abstract":"We consider the manipulability of tournament rules for round-robin tournaments of n competitors. Specifically, n competitors are competing for a prize, and a tournament rule r maps the result of all n(n-1)\/2 pairwise matches (called a tournament, T) to a distribution over winners. Rule r is Condorcet-consistent if whenever i wins all n-1 of her matches, r selects i with probability 1. \r\n\r\nWe consider strategic manipulation of tournaments where player j might throw their match to player i in order to increase the likelihood that one of them wins the tournament. Regardless of the reason why j chooses to do this, the potential for manipulation exists as long as Pr[r(T) = i] increases by more than Pr[r(T) = j] decreases. Unfortunately, it is known that every Condorcet-consistent rule is manipulable. In this work, we address the question of how manipulable Condorcet-consistent rules must necessarily be - by trying to minimize the difference between the increase in Pr[r(T) = i] and decrease in Pr[r(T) = j] for any potential manipulating pair.\r\n\r\nWe show that every Condorcet-consistent rule is in fact 1\/3-manipulable, and that selecting a winner according to a random single elimination bracket is not alpha-manipulable for any alpha > 1\/3. We also show that many previously studied tournament formats are all 1\/2-manipulable, and the popular class of Copeland rules (any rule that selects a player with the most wins) are all in fact 1-manipulable, the worst possible. Finally, we consider extensions to match-fixing among sets of more than two players.","keywords":["Tournament design","Non-manipulability","Condorcet-consistent","Strategyproofness"],"author":[{"@type":"Person","name":"Schneider, Jon","givenName":"Jon","familyName":"Schneider"},{"@type":"Person","name":"Schvartzman, Ariel","givenName":"Ariel","familyName":"Schvartzman"},{"@type":"Person","name":"Weinberg, S. Matthew","givenName":"S. Matthew","familyName":"Weinberg"}],"position":35,"pageStart":"35:1","pageEnd":"35:20","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Schneider, Jon","givenName":"Jon","familyName":"Schneider"},{"@type":"Person","name":"Schvartzman, Ariel","givenName":"Ariel","familyName":"Schvartzman"},{"@type":"Person","name":"Weinberg, S. Matthew","givenName":"S. Matthew","familyName":"Weinberg"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.35","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI10\/paper\/view\/1703","http:\/\/dl.acm.org\/citation.cfm?id=1661445.1661451","http:\/\/www.jstor.org\/stable\/1828886","http:\/\/dx.doi.org\/http:\/\/dx.doi.org\/10.1016\/0895-7177(92)90085-Y","http:\/\/www.bbc.com\/sport\/tennis\/35319202","http:\/\/dx.doi.org\/10.1016\/0022-0531(88)90096-8","http:\/\/dx.doi.org\/10.1137\/0133030","http:\/\/www.jstor.org\/stable\/1911681","http:\/\/www.telegraph.co.uk\/sport\/olympics\/badminton\/9443922\/Badminton-pairs-expelled-from-London-2012-Olympics-after-match-fixing-scandal.html","http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI16\/paper\/view\/12194","http:\/\/ijcai.org\/Abstract\/15\/085","http:\/\/www.jstor.org\/stable\/41105842","http:\/\/dx.doi.org\/10.1007\/s00355-013-0767-6","http:\/\/grantland.com\/features\/the-tennis-triangle\/","http:\/\/www.jstor.org\/stable\/2100804","http:\/\/www.bbc.com\/news\/world-europe-32793892","http:\/\/www.jstor.org\/stable\/41105932","http:\/\/www.gamesindustry.biz\/articles\/2015-10-19-12-arrested-in-esports-match-fixing-scandal-report","http:\/\/www.theguardian.com\/football\/blog\/2014\/feb\/25\/world-cup-25-stunning-moments-no3-germany-austria-1982-rob-smyth","http:\/\/dx.doi.org\/10.5591\/978-1-57735-516-8\/IJCAI11-069","http:\/\/dx.doi.org\/10.1145\/1558013.1558044","http:\/\/www.jstor.org\/stable\/2100365"],"isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9390","name":"Nash Social Welfare, Matrix Permanent, and Stable Polynomials","abstract":"We study the problem of allocating m items to n agents subject to maximizing the Nash social welfare (NSW) objective. We write a novel convex programming relaxation for this problem, and we show that a simple randomized rounding algorithm gives a 1\/e approximation factor of the objective, breaking the 1\/2e^(1\/e) approximation factor of Cole and Gkatzelis.\r\n\r\nOur main technical contribution is an extension of Gurvits's lower bound on the coefficient of the square-free monomial of a degree m-homogeneous stable polynomial on m variables to all homogeneous polynomials. We use this extension to analyze the expected welfare of the allocation returned by our randomized rounding algorithm.","keywords":["Nash Welfare","Permanent","Matching","Stable Polynomial","Randomized Algorithm","Saddle Point"],"author":[{"@type":"Person","name":"Anari, Nima","givenName":"Nima","familyName":"Anari"},{"@type":"Person","name":"Oveis Gharan, Shayan","givenName":"Shayan","familyName":"Oveis Gharan"},{"@type":"Person","name":"Saberi, Amin","givenName":"Amin","familyName":"Saberi"},{"@type":"Person","name":"Singh, Mohit","givenName":"Mohit","familyName":"Singh"}],"position":36,"pageStart":"36:1","pageEnd":"36:12","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Anari, Nima","givenName":"Nima","familyName":"Anari"},{"@type":"Person","name":"Oveis Gharan, Shayan","givenName":"Shayan","familyName":"Oveis Gharan"},{"@type":"Person","name":"Saberi, Amin","givenName":"Amin","familyName":"Saberi"},{"@type":"Person","name":"Singh, Mohit","givenName":"Mohit","familyName":"Singh"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.36","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9391","name":"Multiplayer Parallel Repetition for Expanding Games","abstract":"We investigate the value of parallel repetition of one-round games with any number of players k>=2. It has been an open question whether an analogue of Raz's Parallel Repetition Theorem holds for games with more than two players, i.e., whether the value of the repeated game decays exponentially with the number of repetitions. Verbitsky has shown, via a reduction to the density Hales-Jewett theorem, that the value of the repeated game must approach zero, as the number of repetitions increases. However, the rate of decay obtained in this way is extremely slow, and it is an open question whether the true rate is exponential as is the case for all two-player games.\r\n\t\r\nExponential decay bounds are known for several special cases of multi-player games, e.g., free games and anchored games. In this work, we identify a certain expansion property of the base game and show all games with this property satisfy an exponential decay parallel repetition bound. Free games and anchored games satisfy this expansion property, and thus our parallel repetition theorem reproduces all earlier exponential-decay bounds for multiplayer games. More generally, our parallel repetition bound applies to all multiplayer games that are *connected* in a certain sense.\r\n\t\r\nWe also describe a very simple game, called the GHZ game, that does not satisfy this connectivity property, and for which we do not know an exponential decay bound. We suspect that progress on bounding the value of this the parallel repetition of the GHZ game will lead to further progress on the general question.","keywords":["Parallel Repetition","Multi-player","Expander"],"author":[{"@type":"Person","name":"Dinur, Irit","givenName":"Irit","familyName":"Dinur"},{"@type":"Person","name":"Harsha, Prahladh","givenName":"Prahladh","familyName":"Harsha"},{"@type":"Person","name":"Venkat, Rakesh","givenName":"Rakesh","familyName":"Venkat"},{"@type":"Person","name":"Yuen, Henry","givenName":"Henry","familyName":"Yuen"}],"position":37,"pageStart":"37:1","pageEnd":"37:16","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Dinur, Irit","givenName":"Irit","familyName":"Dinur"},{"@type":"Person","name":"Harsha, Prahladh","givenName":"Prahladh","familyName":"Harsha"},{"@type":"Person","name":"Venkat, Rakesh","givenName":"Rakesh","familyName":"Venkat"},{"@type":"Person","name":"Yuen, Henry","givenName":"Henry","familyName":"Yuen"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.37","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["http:\/\/arxiv.org\/abs\/1509.07466","http:\/\/arxiv.org\/abs\/1603.05349","http:\/\/dx.doi.org\/10.1145\/2746539.2746565","http:\/\/dx.doi.org\/10.4230\/LIPIcs.CCC.2015.512","http:\/\/dx.doi.org\/10.1214\/aoap\/1177005980","http:\/\/dx.doi.org\/10.1119\/1.16243","http:\/\/arxiv.org\/abs\/1603.01512","http:\/\/dx.doi.org\/10.4086\/toc.2009.v005a008","http:\/\/dx.doi.org\/10.1109\/FOCS.2014.51","http:\/\/dx.doi.org\/10.4007\/annals.2012.175.3.6","http:\/\/dx.doi.org\/10.1137\/S0097539795280895","http:\/\/dx.doi.org\/10.1017\/S0963548300000390","http:\/\/dx.doi.org\/10.1016\/0304-3975(95)00165-4"],"isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9392","name":"Cumulative Space in Black-White Pebbling and Resolution","abstract":"We study space complexity and time-space trade-offs with a focus not on peak memory usage but on overall memory consumption throughout the computation. Such a cumulative space measure was introduced for the computational model of parallel black pebbling by [Alwen and Serbinenko 2015] as a tool for obtaining results in cryptography. We consider instead the nondeterministic black-white pebble game and prove optimal cumulative space lower bounds and trade-offs, where in order to minimize pebbling time the space has to remain large during a significant fraction of the pebbling.\r\n\r\nWe also initiate the study of cumulative space in proof complexity, an area where other space complexity measures have been extensively studied during the last 10-15 years. Using and extending the connection between proof complexity and pebble games in [Ben-Sasson and Nordstr\u00f6m 2008, 2011], we obtain several strong cumulative space results for (even parallel versions of) the resolution proof system, and outline some possible future directions of study of this, in our opinion, natural and interesting space measure.","keywords":["pebble game","pebbling","proof complexity","space","cumulative space","clause space","resolution","parallel resolution"],"author":[{"@type":"Person","name":"Alwen, Jo\u00ebl","givenName":"Jo\u00ebl","familyName":"Alwen"},{"@type":"Person","name":"de Rezende, Susanna F.","givenName":"Susanna F.","familyName":"de Rezende"},{"@type":"Person","name":"Nordstr\u00f6m, Jakob","givenName":"Jakob","familyName":"Nordstr\u00f6m"},{"@type":"Person","name":"Vinyals, Marc","givenName":"Marc","familyName":"Vinyals"}],"position":38,"pageStart":"38:1","pageEnd":"38:21","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Alwen, Jo\u00ebl","givenName":"Jo\u00ebl","familyName":"Alwen"},{"@type":"Person","name":"de Rezende, Susanna F.","givenName":"Susanna F.","familyName":"de Rezende"},{"@type":"Person","name":"Nordstr\u00f6m, Jakob","givenName":"Jakob","familyName":"Nordstr\u00f6m"},{"@type":"Person","name":"Vinyals, Marc","givenName":"Marc","familyName":"Vinyals"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.38","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["http:\/\/infolab.stanford.edu\/TR\/CS-TR-78-661.html","http:\/\/www.csc.kth.se\/~jakobn\/research\/","http:\/\/www.modelsofcomputation.org"],"isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9393","name":"A Hierarchy Theorem for Interactive Proofs of Proximity","abstract":"The number of rounds, or round complexity, used in an interactive\r\nprotocol is a fundamental resource. In this work we consider the\r\nsignificance of round complexity in the context of Interactive\r\nProofs of Proximity (IPPs). Roughly speaking, IPPs are interactive proofs in which the verifier runs in sublinear time and is only required to reject inputs that are far from the language.\r\n\r\nOur main result is a round hierarchy theorem for IPPs, showing\r\nthat the power of IPPs grows with the number of rounds. More\r\nspecifically, we show that there exists a gap function\r\ng(r) = Theta(r^2) such that for every constant r \\geq 1 there exists a language that (1) has a g(r)-round IPP with verification time t=t(n,r) but (2) does not have an r-round IPP with verification time t (or even verification time t'=\\poly(t)).\r\n\r\nIn fact, we prove a stronger result by exhibiting a single language L such that, for every constant r \\geq 1, there is an\r\nO(r^2)-round IPP for L with t=n^{O(1\/r)} verification time, whereas the verifier in any r-round IPP for L must run in time at least t^{100}. Moreover, we show an IPP for L with a poly-logarithmic number of rounds and only poly-logarithmic erification time, yielding a sub-exponential separation between the power of constant-round IPPs versus general (unbounded round) IPPs.\r\n\r\nFrom our hierarchy theorem we also derive implications to standard\r\ninteractive proofs (in which the verifier can run in polynomial\r\ntime). Specifically, we show that the round reduction technique of\r\nBabai and Moran (JCSS, 1988) is (almost) optimal among all blackbox transformations, and we show a connection to the algebrization framework of Aaronson and Wigderson (TOCT, 2009).","keywords":["Complexity Theory","Property Testing","Interactive Proofs"],"author":[{"@type":"Person","name":"Gur, Tom","givenName":"Tom","familyName":"Gur"},{"@type":"Person","name":"Rothblum, Ron D.","givenName":"Ron D.","familyName":"Rothblum"}],"position":39,"pageStart":"39:1","pageEnd":"39:43","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Gur, Tom","givenName":"Tom","familyName":"Gur"},{"@type":"Person","name":"Rothblum, Ron D.","givenName":"Ron D.","familyName":"Rothblum"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.39","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["http:\/\/dx.doi.org\/10.1145\/1490270.1490272","http:\/\/dx.doi.org\/10.1007\/BF02122692","http:\/\/dx.doi.org\/10.1145\/800061.808726","http:\/\/dx.doi.org\/10.1007\/s00493-003-0025-0","http:\/\/dx.doi.org\/10.1145\/103418.103428","http:\/\/dx.doi.org\/10.1007\/BF01200056","http:\/\/dx.doi.org\/10.1109\/SFCS.1986.15","http:\/\/dx.doi.org\/10.1145\/2840728.2840746","http:\/\/dx.doi.org\/10.1007\/978-3-642-02927-1_20","http:\/\/dx.doi.org\/10.1007\/978-3-642-40084-1_11","http:\/\/dx.doi.org\/10.1016\/j.ic.2003.09.005","http:\/\/dx.doi.org\/10.1145\/2554797.2554841","http:\/\/dx.doi.org\/10.1016\/0020-0190(88)90199-8","http:\/\/dx.doi.org\/10.1016\/0020-0190(92)90195-2","http:\/\/www.wisdom.weizmann.ac.il\/~oded\/PDF\/mono-maj.pdf","http:\/\/www.wisdom.weizmann.ac.il\/~oded\/pt-intro.html","http:\/\/eccc.hpi-web.de\/report\/2016\/042","http:\/\/eccc.hpi-web.de\/report\/2016\/192","http:\/\/dx.doi.org\/10.4230\/LIPIcs.CCC.2015.1","http:\/\/dx.doi.org\/10.1007\/978-3-662-47672-7_54","http:\/\/dx.doi.org\/10.1109\/SFCS.1987.35","http:\/\/eccc.hpi-web.de\/report\/2013\/109","http:\/\/eccc.hpi-web.de\/report\/2014\/029\/","http:\/\/dx.doi.org\/10.1145\/1162349.1162351","http:\/\/dx.doi.org\/10.1007\/s00037-002-0169-0","http:\/\/dx.doi.org\/10.1137\/0218012","http:\/\/eccc.hpi-web.de\/report\/2015\/049","http:\/\/dx.doi.org\/10.1145\/2688073.2688074","http:\/\/dx.doi.org\/10.1016\/j.ic.2014.12.011","http:\/\/dx.doi.org\/10.1007\/s00037-016-0136-9","http:\/\/dx.doi.org\/10.1007\/11830924_38","http:\/\/dx.doi.org\/10.1007\/978-3-540-70583-3_44","http:\/\/dx.doi.org\/10.1145\/2488608.2488679","http:\/\/dx.doi.org\/10.1145\/2591796.2591809","http:\/\/dx.doi.org\/10.1007\/978-3-662-48000-7_21","http:\/\/dx.doi.org\/10.1145\/146585.146605","http:\/\/dx.doi.org\/10.1137\/110829660","http:\/\/dx.doi.org\/10.1145\/2897518.2897652","http:\/\/dx.doi.org\/10.1137\/S0097539793255151","http:\/\/dx.doi.org\/10.1145\/28395.28404","http:\/\/dx.doi.org\/10.1007\/3-540-60615-7","http:\/\/dx.doi.org\/10.4230\/LIPIcs.ICALP.2016.17","http:\/\/dx.doi.org\/10.1145\/335305.335330","http:\/\/dx.doi.org\/10.1016\/0196-6774(84)90016-6","http:\/\/dx.doi.org\/10.1145\/1515698.1515709","http:\/\/dx.doi.org\/10.4230\/LIPIcs.CCC.2016.2"],"isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9394","name":"Cube vs. Cube Low Degree Test","abstract":"We revisit the Raz-Safra plane-vs.-plane test and study the closely related cube vs. cube test. In this test the tester has access to a \"cubes table\" which assigns to every cube a low degree polynomial. The tester randomly selects two cubes (affine sub-spaces of dimension 3) that intersect on a point x in F^m, and checks that the assignments to the cubes agree with each other on the point x. Our main result is a new combinatorial proof for a low degree test that comes closer to the soundness limit, as it works for all epsilon >= poly(d)\/{|F|}^{1\/2}, where d is the degree. This should be compared to the previously best soundness value of epsilon >= poly(m, d)\/|F|^{1\/8}. Our soundness limit improves upon the dependence on the field size and does not depend on the dimension of the ambient space.\r\n\r\nOur proof is combinatorial and direct: unlike the Raz-Safra proof, it proceeds in one shot and does not require induction on the dimension of the ambient space. The ideas in our proof come from works on direct product testing which are even simpler in the current setting thanks to the low degree.\r\n\r\nAlong the way we also prove a somewhat surprising fact about connection between different agreement tests: it does not matter if the tester chooses the cubes to intersect on points or on lines: for every given table, its success probability in either test is nearly the same.","keywords":["Low Degree Test","Probabilistically Checkable Proofs","Locally Testable Codes"],"author":[{"@type":"Person","name":"Bhangale, Amey","givenName":"Amey","familyName":"Bhangale"},{"@type":"Person","name":"Dinur, Irit","givenName":"Irit","familyName":"Dinur"},{"@type":"Person","name":"Livni Navon, Inbal","givenName":"Inbal","familyName":"Livni Navon"}],"position":40,"pageStart":"40:1","pageEnd":"40:31","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Bhangale, Amey","givenName":"Amey","familyName":"Bhangale"},{"@type":"Person","name":"Dinur, Irit","givenName":"Irit","familyName":"Dinur"},{"@type":"Person","name":"Livni Navon, Inbal","givenName":"Inbal","familyName":"Livni Navon"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.40","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9395","name":"On the Power of Learning from k-Wise Queries","abstract":"Several well-studied models of access to data samples, including statistical queries, local differential privacy and low-communication algorithms rely on queries that provide information about a function of a single sample. (For example, a statistical query (SQ) gives an estimate of Ex_{x ~ D}[q(x)] for any choice of the query function q mapping X to the reals, where D is\r\nan unknown data distribution over X.) Yet some data analysis algorithms rely on properties of functions that depend on multiple samples. Such algorithms would be naturally implemented using k-wise queries each of which is specified by a function q mapping X^k to the reals. Hence it is natural to ask whether algorithms using k-wise queries can solve learning problems more efficiently and by how much.\r\nBlum, Kalai and Wasserman (2003) showed that for any weak PAC learning problem over a fixed distribution, the complexity of learning with k-wise SQs is smaller than the (unary) SQ complexity by a factor of at most 2^k. We show that for more general problems over distributions the picture is substantially richer. For every k, the complexity of distribution-independent PAC learning with k-wise queries can be exponentially larger than learning with (k+1)-wise queries. We then give two approaches for simulating a k-wise query using unary queries. The first approach exploits the structure of the\r\nproblem that needs to be solved. It generalizes and strengthens (exponentially)\r\nthe results of Blum et al.. It allows us to derive strong lower bounds for\r\nlearning DNF formulas and stochastic constraint satisfaction problems that hold\r\nagainst algorithms using k-wise queries. The second approach exploits the\r\nk-party communication complexity of the k-wise query function.","keywords":["Statistical Queries","PAC Learning","Differential Privacy","Lower bounds","Communication Complexity"],"author":[{"@type":"Person","name":"Feldman, Vitaly","givenName":"Vitaly","familyName":"Feldman"},{"@type":"Person","name":"Ghazi, Badih","givenName":"Badih","familyName":"Ghazi"}],"position":41,"pageStart":"41:1","pageEnd":"41:32","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Feldman, Vitaly","givenName":"Vitaly","familyName":"Feldman"},{"@type":"Person","name":"Ghazi, Badih","givenName":"Badih","familyName":"Ghazi"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.41","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["http:\/\/www.jmlr.org\/proceedings\/papers\/v23\/balcan12a\/balcan12a.pdf","http:\/\/dx.doi.org\/10.1007\/s00453-014-9954-9","http:\/\/dx.doi.org\/10.1006\/jcss.1998.1569","http:\/\/dl.acm.org\/citation.cfm?id=92644","http:\/\/dx.doi.org\/10.1145\/1065167.1065184","http:\/\/jmlr.org\/proceedings\/papers\/v49\/daniely16.html","http:\/\/arxiv.org\/abs\/1611.03473","http:\/\/dx.doi.org\/10.1145\/773153.773173","http:\/\/dx.doi.org\/10.1145\/1007352.1007404","http:\/\/dx.doi.org\/10.1007\/11681878_14","http:\/\/arxiv.org\/abs\/1611.06475","http:\/\/arxiv.org\/abs\/1608.02198","http:\/\/arxiv.org\/abs\/1512.09170","https:\/\/dslpitt.org\/uai\/displayArticleDetails.jsp?mmnu=1&smnu=2&article_id=1600&proceeding_id=25","http:\/\/jmlr.org\/proceedings\/papers\/v40\/Steinhardt15.html"],"isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9396","name":"Detecting communities is Hard (And Counting Them is Even Harder)","abstract":"We consider the algorithmic problem of community detection in networks. Given an undirected friendship graph G, a subset\r\nS of vertices is an (a,b)-community if: * Every member of the community is friends with an (a)-fraction of the community; and\r\n* every non-member is friends with at most a (b)-fraction of the\r\ncommunity. \r\n\r\n[Arora, Ge, Sachdeva, Schoenebeck 2012] gave a quasi-polynomial\r\ntime algorithm for enumerating all the (a,b)-communities\r\nfor any constants a>b. \r\n\r\nHere, we prove that, assuming the Exponential Time Hypothesis (ETH),\r\nquasi-polynomial time is in fact necessary - and even for a much weaker\r\napproximation desideratum. Namely, distinguishing between:\r\n* G contains an (1,o(1))-community; and\r\n* G does not contain a (b,b+o(1))-community\r\nfor any b.\r\n\r\nWe also prove that counting the number of (1,o(1))-communities\r\nrequires quasi-polynomial time assuming the weaker #ETH.","keywords":["Community detection","stable communities","quasipolynomial time"],"author":{"@type":"Person","name":"Rubinstein, Aviad","givenName":"Aviad","familyName":"Rubinstein"},"position":42,"pageStart":"42:1","pageEnd":"42:13","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":{"@type":"Person","name":"Rubinstein, Aviad","givenName":"Aviad","familyName":"Rubinstein"},"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.42","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9397","name":"Inherent Trade-Offs in the Fair Determination of Risk Scores","abstract":"Recent discussion in the public sphere about algorithmic classification has involved tension between competing notions of what it means for a probabilistic classification to be fair to different groups. We formalize three fairness conditions that lie at the heart of these debates, and we prove that except in highly constrained special cases, there is no method that can satisfy these three conditions simultaneously. Moreover, even satisfying all three conditions approximately requires that the data lie in an approximate version of one of the constrained special cases identified by our theorem. These results suggest some of the ways in which key notions of fairness are incompatible with each other, and hence provide a framework for thinking about the trade-offs between them.","keywords":["algorithmic fairness","risk tools","calibration"],"author":[{"@type":"Person","name":"Kleinberg, Jon","givenName":"Jon","familyName":"Kleinberg"},{"@type":"Person","name":"Mullainathan, Sendhil","givenName":"Sendhil","familyName":"Mullainathan"},{"@type":"Person","name":"Raghavan, Manish","givenName":"Manish","familyName":"Raghavan"}],"position":43,"pageStart":"43:1","pageEnd":"43:23","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Kleinberg, Jon","givenName":"Jon","familyName":"Kleinberg"},{"@type":"Person","name":"Mullainathan, Sendhil","givenName":"Sendhil","familyName":"Mullainathan"},{"@type":"Person","name":"Raghavan, Manish","givenName":"Manish","familyName":"Raghavan"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.43","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["https:\/\/www.propublica.org\/article\/machine-bias-risk-assessments-in-criminal-sentencing","http:\/\/www.degruyter.com\/view\/j\/popets.2015.1.issue-1\/popets-2015-0007\/popets-2015-0007.xml","http:\/\/www.northpointeinc.com\/northpointe-analysis","http:\/\/dx.doi.org\/10.1145\/2090236.2090255","http:\/\/dx.doi.org\/10.1145\/2783258.2783311","http:\/\/www.crj.org\/cji\/entry\/false-positives-false-negatives-and-false-analyses-a-rejoinder","https:\/\/medium.com\/@AbeGong\/ethics-for-powerful-algorithms-1-of-3-a060054efd84#.dhsd2ut3i","http:\/\/dx.doi.org\/10.1109\/IC4.2009.4909197","http:\/\/dx.doi.org\/10.1109\/ICDMW.2011.83","https:\/\/www.propublica.org\/article\/how-we-analyzed-the-compas-recidivism-algorithm","https:\/\/docs.google.com\/document\/d\/1pKtyl8XmJH7Z09lxkb70n6fa2Fiitd7ydbxgCT_wCXs\/edit?pref=2&pli=1","http:\/\/dx.doi.org\/10.1145\/2447976.2447990","http:\/\/jmlr.org\/proceedings\/papers\/v28\/zemel13.html"],"isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9398","name":"Non-Backtracking Spectrum of Degree-Corrected Stochastic Block Models","abstract":"Motivated by community detection, we characterise the spectrum of the non-backtracking matrix B in the Degree-Corrected Stochastic Block Model.\r\n\r\nSpecifically, we consider a random graph on n vertices partitioned into two asymptotically equal-sized clusters. The vertices have i.i.d. weights {\\phi_u}_{u=1}^n with second moment \\PHItwo. The intra-cluster connection probability for vertices u and v is \\frac{\\phi_u \\phi_v}{n}a and the inter-cluster connection probability is \\frac{\\phi_u \\phi_v}{n}b. \r\n\r\nWe show that with high probability, the following holds: The leading eigenvalue of the non-backtracking matrix B is asymptotic to \\rho = \\frac{a+b}{2} \\PHItwo. The second eigenvalue is asymptotic to \\mu_2 = \\frac{a-b}{2} \\PHItwo when \\mu_2^2 > \\rho, but asymptotically bounded by \\sqrt{\\rho} when \\mu_2^2 \\leq \\rho. All the remaining eigenvalues are asymptotically bounded by \\sqrt{\\rho}. As a result, a clustering positively-correlated with the true communities can be obtained based on the second eigenvector of B in the regime where \\mu_2^2 > \\rho.\r\n\r\nIn a previous work we obtained that detection is impossible when $\\mu_2^2 \\leq \\rho,$ meaning that there occurs a phase-transition in the sparse regime of the Degree-Corrected Stochastic Block Model. \r\n\r\nAs a corollary, we obtain that Degree-Corrected Erd\u00f6s-R\u00e9nyi graphs asymptotically satisfy the graph Riemann hypothesis, a quasi-Ramanujan property.\r\n\r\nA by-product of our proof is a weak law of large numbers for local-functionals on Degree-Corrected Stochastic Block Models, which could be of independent interest.","keywords":["Degree-Corrected Stochastic Block Model","Non-backtracking Matrix","Machine Learning","Social Networks"],"author":[{"@type":"Person","name":"Gulikers, Lennart","givenName":"Lennart","familyName":"Gulikers"},{"@type":"Person","name":"Lelarge, Marc","givenName":"Marc","familyName":"Lelarge"},{"@type":"Person","name":"Massouli\u00e9, Laurent","givenName":"Laurent","familyName":"Massouli\u00e9"}],"position":44,"pageStart":"44:1","pageEnd":"44:27","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Gulikers, Lennart","givenName":"Lennart","familyName":"Gulikers"},{"@type":"Person","name":"Lelarge, Marc","givenName":"Marc","familyName":"Lelarge"},{"@type":"Person","name":"Massouli\u00e9, Laurent","givenName":"Laurent","familyName":"Massouli\u00e9"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.44","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9399","name":"Conditional Sparse Linear Regression","abstract":"Machine learning and statistics typically focus on building models that capture the vast majority of the data, possibly ignoring a small subset of data as \"noise\" or \"outliers.\" By contrast, here we consider the problem of jointly identifying a significant (but perhaps small) segment of a population in which there is a highly sparse linear regression fit, together with the coefficients for the linear fit. We contend that such tasks are of interest both because the models themselves may be able to achieve better predictions in such special cases, but also because they may aid our understanding of the data. We give algorithms for such problems under the sup norm, when this unknown segment of the population is described by a k-DNF condition and the regression fit is s-sparse for constant k and s. For the variants of this problem when the regression fit is not so sparse or using expected error, we also give a preliminary algorithm and highlight the question as a challenge for future work.","keywords":["linear regression","conditional regression","conditional distribution search"],"author":{"@type":"Person","name":"Juba, Brendan","givenName":"Brendan","familyName":"Juba"},"position":45,"pageStart":"45:1","pageEnd":"45:14","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":{"@type":"Person","name":"Juba, Brendan","givenName":"Brendan","familyName":"Juba"},"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.45","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["http:\/\/dx.doi.org\/10.1145\/76359.76371","http:\/\/dx.doi.org\/10.1007\/s10994-005-0464-5","http:\/\/dx.doi.org\/10.1145\/2897518.2897520","http:\/\/dx.doi.org\/10.1145\/358669.358692","http:\/\/dx.doi.org\/10.1023\/A:1008894516817","http:\/\/dx.doi.org\/10.1016\/j.jcss.2011.12.026","http:\/\/dx.doi.org\/10.1137\/S0097539792240406","http:\/\/dx.doi.org\/10.1145\/48014.63140","http:\/\/dx.doi.org\/10.1109\/DSAA.2015.7344866","http:\/\/dx.doi.org\/10.1007\/3-540-44929-9_3"],"isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9400","name":"Rigorous Rg Algorithms and Area Laws for Low Energy Eigenstates In 1D","abstract":"One of the central challenges in the study of quantum many-body systems is the complexity of simulating them on a classical computer. A recent advance by Landau et al. gave a polynomial time algorithm to compute a succinct classical description for unique ground states of gapped 1D quantum systems. Despite this progress many questions remained unresolved, including whether there exist rigorous efficient algorithms when the ground space is degenerate (and poly(n) dimensional), or for the poly(n) lowest energy states for 1D systems, or even whether such states admit succinct classical descriptions or area laws. \r\n\r\nIn this paper we give a new algorithm for finding low energy states for 1D systems, based on a rigorously justified renormalization group (RG)-type transformation. In the process we resolve some of the aforementioned open questions, including giving a polynomial time algorithm for poly(n) degenerate ground spaces and an n^{O(\\log n)} algorithm for the poly(n) lowest energy states for 1D systems (under a mild density condition). We note that for these classes of systems the existence of a succinct classical description and area laws were not rigorously proved before this work. The algorithms are natural and efficient, and for the case of finding unique ground states for frustration-free Hamiltonians the running time is O(nM(n)), where M(n) is the time required to multiply two n by n matrices.","keywords":["Hamiltonian complexity","area law","gapped ground states","algorithm"],"author":[{"@type":"Person","name":"Arad, Itai","givenName":"Itai","familyName":"Arad"},{"@type":"Person","name":"Landau, Zeph","givenName":"Zeph","familyName":"Landau"},{"@type":"Person","name":"Vazirani, Umesh V.","givenName":"Umesh V.","familyName":"Vazirani"},{"@type":"Person","name":"Vidick, Thomas","givenName":"Thomas","familyName":"Vidick"}],"position":46,"pageStart":"46:1","pageEnd":"46:14","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Arad, Itai","givenName":"Itai","familyName":"Arad"},{"@type":"Person","name":"Landau, Zeph","givenName":"Zeph","familyName":"Landau"},{"@type":"Person","name":"Vazirani, Umesh V.","givenName":"Umesh V.","familyName":"Vazirani"},{"@type":"Person","name":"Vidick, Thomas","givenName":"Thomas","familyName":"Vidick"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.46","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["http:\/\/dx.doi.org\/10.1007\/s00220-008-0710-3","https:\/\/arxiv.org\/abs\/1602.08828","http:\/\/arxiv.org\/abs\/1502.06967","http:\/\/dx.doi.org\/10.1103\/RevModPhys.82.277","http:\/\/stacks.iop.org\/1742-5468\/2007\/i=08\/a=P08024","http:\/\/arxiv.org\/abs\/1406.6355","http:\/\/arxiv.org\/abs\/1510.01303","http:\/\/arxiv.org\/abs\/1307.5143","http:\/\/arxiv.org\/abs\/1410.3831","http:\/\/arxiv.org\/abs\/1011.3027","http:\/\/dx.doi.org\/10.1103\/PhysRevLett.101.110501","http:\/\/dx.doi.org\/10.1103\/PhysRevLett.69.2863"],"isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9401","name":"The Flow of Information in Interactive Quantum Protocols: the Cost of Forgetting","abstract":"In two-party interactive quantum communication protocols,\r\nwe study a recently defined notion of quantum information cost (QIC), which has most of the important properties of its classical analogue (IC). Notably, its link with amortized quantum communication complexity has been used to prove an (almost) tight lower bound on the bounded round quantum complexity of Disjointness.\r\nHowever, QIC was defined through a purification of the input state. This is valid for fully quantum inputs and tasks but difficult to interpret even for classical tasks.\r\nAlso, its link with other notions of information cost that had appeared in the literature was not clear. \r\n\r\nWe settle both these issues: for quantum communication with classical inputs, we characterize QIC in terms of information about the input registers, avoiding any reference to the notion of a purification of the classical input state. We provide an operational interpretation of this new characterization as the sum of the costs of revealing and of forgetting information about the inputs. \r\nTo obtain this result, we prove a general Information Flow Lemma assessing the transfer of information in general interactive quantum processes. Specializing this lemma to interactive quantum protocols accomplishing classical tasks, we are able to demistify the link between QIC and other previous notions of information cost in quantum protocols. Furthermore, we clarify the link between QIC and IC by simulating quantumly classical protocols.\r\n\r\nFinally, we apply these concepts to argue that any quantum protocol that does not forget information solves Disjointness on n-bits in Omega(n) communication, completely losing the quadratic quantum speedup. Hence forgetting information is here a necessary feature in order to obtain any significant improvement over classical protocols. We also prove that QIC at 0-error\r\nis exactly n for Inner Product, and n (1 - o(1)) for a random Boolean function on n+n bits.","keywords":["Communication Complexity","Information Complexity","Quantum Computation and Information"],"author":[{"@type":"Person","name":"Lauri\u00e8re, Mathieu","givenName":"Mathieu","familyName":"Lauri\u00e8re"},{"@type":"Person","name":"Touchette, Dave","givenName":"Dave","familyName":"Touchette"}],"position":47,"pageStart":"47:1","pageEnd":"47:1","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Lauri\u00e8re, Mathieu","givenName":"Mathieu","familyName":"Lauri\u00e8re"},{"@type":"Person","name":"Touchette, Dave","givenName":"Dave","familyName":"Touchette"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.47","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9402","name":"Overlapping Qubits","abstract":"An ideal system of n qubits has 2^n dimensions. This exponential grants power, but also hinders characterizing the system's state and dynamics. We study a new problem: the qubits in a physical system might not be independent. They can \"overlap,\" in the sense that an operation on one qubit slightly affects the others. \r\n\r\nWe show that allowing for slight overlaps, n qubits can fit in just polynomially many dimensions. (Defined in a natural way, all pairwise overlaps can be <= epsilon in n^{O(1\/epsilon^2)} dimensions.) Thus, even before considering issues like noise, a real system of n qubits might inherently lack any potential for exponential power. \r\n\r\nOn the other hand, we also provide an efficient test to certify exponential dimensionality. Unfortunately, the test is sensitive to noise. It is important to devise more robust tests on the arrangements of qubits in quantum devices.","keywords":["Quantum computing","Qubits","Dimension test"],"author":[{"@type":"Person","name":"Chao, Rui","givenName":"Rui","familyName":"Chao"},{"@type":"Person","name":"Reichardt, Ben W.","givenName":"Ben W.","familyName":"Reichardt"},{"@type":"Person","name":"Sutherland, Chris","givenName":"Chris","familyName":"Sutherland"},{"@type":"Person","name":"Vidick, Thomas","givenName":"Thomas","familyName":"Vidick"}],"position":48,"pageStart":"48:1","pageEnd":"48:21","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Chao, Rui","givenName":"Rui","familyName":"Chao"},{"@type":"Person","name":"Reichardt, Ben W.","givenName":"Ben W.","familyName":"Reichardt"},{"@type":"Person","name":"Sutherland, Chris","givenName":"Chris","familyName":"Sutherland"},{"@type":"Person","name":"Vidick, Thomas","givenName":"Thomas","familyName":"Vidick"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.48","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["http:\/\/dx.doi.org\/10.1103\/PhysRevA.92.062328","http:\/\/dx.doi.org\/10.1016\/S0012-365X(03)00227-9","http:\/\/dx.doi.org\/10.1109\/SFCS.1991.185442","http:\/\/dx.doi.org\/10.1007\/BF02227441","http:\/\/dx.doi.org\/10.1002\/rsa.10073","http:\/\/dx.doi.org\/10.1090\/conm\/026\/737400","http:\/\/dx.doi.org\/10.1103\/PhysRevA.90.012332","http:\/\/dx.doi.org\/10.1006\/jfan.1993.1029","http:\/\/dx.doi.org\/10.1109\/SFCS.1998.743501","http:\/\/dx.doi.org\/10.1088\/1751-8113\/45\/45\/455304","http:\/\/dx.doi.org\/10.1137\/140958578","http:\/\/dx.doi.org\/10.1109\/SFFCS.1999.814608","https:\/\/terrytao.wordpress.com\/2013\/07\/18\/a-cheap-version-of-the-kabatjanskii-levenstein-bound-for-almost-orthogonal-vectors\/"],"isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9403","name":"Quantum Recommendation Systems","abstract":"A recommendation system uses the past purchases or ratings of n products by a group of m users, in order to provide personalized recommendations to individual users. The information is modeled as an m \\times n preference matrix which is assumed to have a good rank-k approximation, for a small constant k. \r\n\r\nIn this work, we present a quantum algorithm for recommendation systems that has running time O(\\text{poly}(k)\\text{polylog}(mn)). All known classical algorithms for recommendation systems that work through reconstructing an approximation of the preference matrix run in time polynomial in the matrix dimension. Our algorithm provides good recommendations by sampling efficiently from an approximation of the preference matrix, without reconstructing the entire matrix. For this, we design an efficient quantum procedure to project a given vector onto the row space of a given matrix. This is the first algorithm for recommendation systems that runs in time polylogarithmic in the dimensions of the matrix and provides an example of a quantum machine learning algorithm for a real world application.","keywords":["Recommendation systems","quantum machine learning","singular value estimation","matrix sampling","quantum algorithms."],"author":[{"@type":"Person","name":"Kerenidis, Iordanis","givenName":"Iordanis","familyName":"Kerenidis"},{"@type":"Person","name":"Prakash, Anupam","givenName":"Anupam","familyName":"Prakash"}],"position":49,"pageStart":"49:1","pageEnd":"49:21","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Kerenidis, Iordanis","givenName":"Iordanis","familyName":"Kerenidis"},{"@type":"Person","name":"Prakash, Anupam","givenName":"Anupam","familyName":"Prakash"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.49","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9404","name":"Random Walks in Polytopes and Negative Dependence","abstract":"We present a Gaussian random walk in a polytope that starts at a point inside and continues until it gets absorbed at a vertex. Our main result is that the probability distribution induced on the\r\nvertices by this random walk has strong negative dependence properties for matroid polytopes. Such distributions are highly sought after in randomized algorithms as they imply concentration\r\nproperties. Our random walk is simple to implement, computationally efficient and can be viewed as an algorithm to round the starting point in an unbiased manner. The proof relies on a simple\r\ninductive argument that synthesizes the combinatorial structure of matroid polytopes with the geometric structure of multivariate Gaussian distributions. Our result not only implies a long\r\nline of past results in a unified and transparent manner, but also implies new results about constructing negatively associated distributions for all matroids.","keywords":["Random walks","Matroid","Polytope","Brownian motion","Negative dependence"],"author":[{"@type":"Person","name":"Peres, Yuval","givenName":"Yuval","familyName":"Peres"},{"@type":"Person","name":"Singh, Mohit","givenName":"Mohit","familyName":"Singh"},{"@type":"Person","name":"Vishnoi, Nisheeth K.","givenName":"Nisheeth K.","familyName":"Vishnoi"}],"position":50,"pageStart":"50:1","pageEnd":"50:10","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Peres, Yuval","givenName":"Yuval","familyName":"Peres"},{"@type":"Person","name":"Singh, Mohit","givenName":"Mohit","familyName":"Singh"},{"@type":"Person","name":"Vishnoi, Nisheeth K.","givenName":"Nisheeth K.","familyName":"Vishnoi"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.50","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["http:\/\/jmlr.org\/proceedings\/papers\/v49\/anari16.html","http:\/\/dx.doi.org\/10.1137\/1.9781611973075.32","http:\/\/dx.doi.org\/10.1137\/130929400","http:\/\/dx.doi.org\/10.1145\/2591796.2591803"],"isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9405","name":"Simultaneously Load Balancing for Every p-norm, With Reassignments","abstract":"This paper investigates the task of load balancing where the objective function is to minimize the p-norm of loads, for p\\geq 1, in both static and incremental settings. We consider two closely related load balancing problems. In the bipartite matching problem we are given a bipartite graph G=(C\\cup S, E) and the goal is to assign each client c\\in C to a server s\\in S so that the p-norm of assignment loads on S is minimized.\r\nIn the graph orientation problem the goal is to orient (direct) the edges of a given undirected graph while minimizing the p-norm of the out-degrees. The graph orientation problem is a special case of the bipartite matching problem, but less complex, which leads to simpler algorithms.\r\n\r\nFor the graph orientation problem we show that the celebrated Chiba-Nishizeki peeling algorithm provides a simple linear time load balancing scheme whose output is an orientation that is 2-competitive, in a p-norm sense, for all p\\geq 1. For the bipartite matching problem we first provide an offline algorithm that computes an optimal assignment. We then extend this solution to the online bipartite matching problem with reassignments, where vertices from C arrive in an online fashion together with their corresponding edges, and we are allowed to reassign an amortized O(1) vertices from C each time a new vertex arrives. In this online scenario we show how to maintain a single assignment that is 8-competitive, in a p-norm sense, for all p\\geq 1.","keywords":["Online Matching","Graph Orientation","Minmizing the p-norm"],"author":[{"@type":"Person","name":"Bernstein, Aaron","givenName":"Aaron","familyName":"Bernstein"},{"@type":"Person","name":"Kopelowitz, Tsvi","givenName":"Tsvi","familyName":"Kopelowitz"},{"@type":"Person","name":"Pettie, Seth","givenName":"Seth","familyName":"Pettie"},{"@type":"Person","name":"Porat, Ely","givenName":"Ely","familyName":"Porat"},{"@type":"Person","name":"Stein, Clifford","givenName":"Clifford","familyName":"Stein"}],"position":51,"pageStart":"51:1","pageEnd":"51:14","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Bernstein, Aaron","givenName":"Aaron","familyName":"Bernstein"},{"@type":"Person","name":"Kopelowitz, Tsvi","givenName":"Tsvi","familyName":"Kopelowitz"},{"@type":"Person","name":"Pettie, Seth","givenName":"Seth","familyName":"Pettie"},{"@type":"Person","name":"Porat, Ely","givenName":"Ely","familyName":"Porat"},{"@type":"Person","name":"Stein, Clifford","givenName":"Clifford","familyName":"Stein"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.51","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["http:\/\/dx.doi.org\/10.1145\/210332.210337","http:\/\/dx.doi.org\/10.1007\/3-540-48447-7_34","http:\/\/dl.acm.org\/citation.cfm?id=1283383.1283433","http:\/\/dx.doi.org\/10.1016\/0304-3975(91)90020-3","http:\/\/dx.doi.org\/10.1007\/978-3-642-40104-6_27","http:\/\/dl.acm.org\/citation.cfm?id=2095116.2095169","http:\/\/dx.doi.org\/10.1145\/1597036.1597042","http:\/\/dx.doi.org\/10.1007\/978-3-642-23719-5_48","http:\/\/dl.acm.org\/citation.cfm?id=647910.740462","http:\/\/dx.doi.org\/10.1016\/j.ipl.2006.12.006","http:\/\/dx.doi.org\/10.1145\/1159892.1159895","http:\/\/dx.doi.org\/10.1145\/2488608.2488703","http:\/\/dx.doi.org\/10.1007\/PL00009214","http:\/\/dx.doi.org\/10.1137\/S0097539702403438","http:\/\/dx.doi.org\/10.1287\/moor.1090.0381","http:\/\/dx.doi.org\/10.1007\/978-3-642-15775-2_4","http:\/\/dx.doi.org\/10.1006\/jagm.2000.1074"],"isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9406","name":"Approximating Approximate Distance Oracles","abstract":"Given a finite metric space (V,d), an approximate distance oracle is a data structure which, when queried on two points u,v \\in V, returns an approximation to the the actual distance between u and v which is within some bounded stretch factor of the true distance. There has been significant work on the tradeoff between the important parameters of approximate distance oracles (and in particular between the size, stretch, and query time), but in this paper we take a different point of view, that of per-instance optimization. If we are given an particular input metric space and stretch bound, can we find the smallest possible approximate distance oracle for that particular input? Since this question is not even well-defined, we restrict our attention to well-known classes of approximate distance oracles, and study whether we can optimize over those classes. \r\n\r\nIn particular, we give an O(\\log n)-approximation to the problem of finding the smallest stretch 3 Thorup-Zwick distance oracle, as well as the problem of finding the smallest P\\v{a}tra\\c{s}cu-Roditty distance oracle. We also prove a matching \\Omega(\\log n) lower bound for both problems, and an \\Omega(n^{\\frac{1}{k}-\\frac{1}{2^{k-1}}}) integrality gap for the more general stretch (2k-1) Thorup-Zwick distance oracle. We also consider the problem of approximating the best TZ or PR approximate distance oracle with outliers, and show that more advanced techniques (SDP relaxations in particular) allow us to optimize even in the presence of outliers.","keywords":["distance oracles","approximation algorithms"],"author":[{"@type":"Person","name":"Dinitz, Michael","givenName":"Michael","familyName":"Dinitz"},{"@type":"Person","name":"Zhang, Zeyu","givenName":"Zeyu","familyName":"Zhang"}],"position":52,"pageStart":"52:1","pageEnd":"52:14","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Dinitz, Michael","givenName":"Michael","familyName":"Dinitz"},{"@type":"Person","name":"Zhang, Zeyu","givenName":"Zeyu","familyName":"Zhang"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.52","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["http:\/\/dx.doi.org\/10.1109\/FOCS.2012.61","https:\/\/arxiv.org\/abs\/1612.05623"],"isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9407","name":"Fast Cross-Polytope Locality-Sensitive Hashing","abstract":"We provide a variant of cross-polytope locality sensitive hashing with respect to angular distance which is provably optimal in asymptotic sensitivity and enjoys \\mathcal{O}(d \\ln d ) hash computation time. Building on a recent result in (Andoni, Indyk, Laarhoven, Razenshteyn '15), we show that optimal asymptotic sensitivity for cross-polytope LSH is retained even when the dense Gaussian matrix is replaced by a fast Johnson-Lindenstrauss transform followed by discrete pseudo-rotation, reducing the hash computation time from \\mathcal{O}(d^2) to \\mathcal{O}(d \\ln d ). Moreover, our scheme achieves the optimal rate of convergence for sensitivity. By incorporating a low-randomness Johnson-Lindenstrauss transform, our scheme can be modified to require only \\mathcal{O}(\\ln^9(d)) random bits.","keywords":["Locality-sensitive hashing","Dimension reduction","Johnson-Lindenstrauss lemma"],"author":[{"@type":"Person","name":"Kennedy, Christopher","givenName":"Christopher","familyName":"Kennedy"},{"@type":"Person","name":"Ward, Rachel","givenName":"Rachel","familyName":"Ward"}],"position":53,"pageStart":"53:1","pageEnd":"53:16","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Kennedy, Christopher","givenName":"Christopher","familyName":"Kennedy"},{"@type":"Person","name":"Ward, Rachel","givenName":"Rachel","familyName":"Ward"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.53","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["http:\/\/dx.doi.org\/10.1137\/060673096","http:\/\/dx.doi.org\/10.1109\/FOCS.2006.49","http:\/\/dl.acm.org\/citation.cfm?id=2969239.2969376","http:\/\/dx.doi.org\/10.1145\/2746539.2746553","http:\/\/arxiv.org\/abs\/1507.04299","http:\/\/eprint.iacr.org\/","http:\/\/dl.acm.org\/citation.cfm?id=2884435.2884457","http:\/\/dx.doi.org\/10.1145\/276698.276876","http:\/\/dx.doi.org\/10.1145\/2559902","http:\/\/dx.doi.org\/10.1109\/CVPR.2013.64","http:\/\/papers.nips.cc\/paper\/2666-an-investigation-of-practical-approximate-nearest-neighbor-algorithms.pdf","http:\/\/dx.doi.org\/10.1145\/1137856.1137881","http:\/\/dx.doi.org\/10.1145\/2578221"],"isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9408","name":"The Distortion of Locality Sensitive Hashing","abstract":"Given a pairwise similarity notion between objects, locality sensitive hashing (LSH) aims to construct a hash function family over the universe of objects such that the probability two objects hash to the same value is their similarity. LSH is a powerful algorithmic tool for large-scale applications and much work has been done to understand LSHable similarities, i.e., similarities that admit an LSH.\r\nIn this paper we focus on similarities that are provably non-LSHable and propose a notion of distortion to capture the approximation of such a similarity by a similarity that is LSHable. We consider several well-known non-LSHable similarities and show tight upper and lower bounds on their distortion. We also experimentally show that our upper bounds translate to e","keywords":["locality sensitive hashing","distortion","similarity"],"author":[{"@type":"Person","name":"Chierichetti, Flavio","givenName":"Flavio","familyName":"Chierichetti"},{"@type":"Person","name":"Kumar, Ravi","givenName":"Ravi","familyName":"Kumar"},{"@type":"Person","name":"Panconesi, Alessandro","givenName":"Alessandro","familyName":"Panconesi"},{"@type":"Person","name":"Terolli, Erisa","givenName":"Erisa","familyName":"Terolli"}],"position":54,"pageStart":"54:1","pageEnd":"54:18","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Chierichetti, Flavio","givenName":"Flavio","familyName":"Chierichetti"},{"@type":"Person","name":"Kumar, Ravi","givenName":"Ravi","familyName":"Kumar"},{"@type":"Person","name":"Panconesi, Alessandro","givenName":"Alessandro","familyName":"Panconesi"},{"@type":"Person","name":"Terolli, Erisa","givenName":"Erisa","familyName":"Terolli"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.54","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9409","name":"Constructive Non-Commutative Rank Computation Is in Deterministic Polynomial Time","abstract":"Let {\\mathcal B} be a linear space of matrices over a field {\\mathbb spanned by n\\times n \r\nmatrices B_1, \\dots, B_m. The non-commutative rank of {\\mathcal B}$ is the minimum r\\in {\\mathbb N} such that there exists U\\leq {\\mathbb F}^n satisfying \\dim(U)-\\dim( {\\mathcal B} (U))\\geq \r\nn-r, where {\\mathcal B}(U):={\\mathrm span}(\\cup_{i\\in[m]} B_i(U)). \r\n \r\nComputing the non-commutative rank generalizes some well-known problems including the bipartite graph maximum \r\nmatching problem and the linear matroid intersection problem. \r\n\r\nIn this paper we give a deterministic polynomial-time algorithm to compute the \r\nnon-commutative rank over \r\nany field {\\mathbb F}. Prior to our work, such \r\nan \r\nalgorithm was only known over the rational number field {\\mathbb Q}, a result due to Garg et al, [GGOW]. Our algorithm is constructive and produces a witness\r\ncertifying the non-commutative rank, a feature that is missing in the algorithm from [GGOW].\r\n\r\nOur result is built on techniques which we developed in a previous paper [IQS1], with a new reduction procedure that \r\nhelps to keep the blow-up parameter small. There are two ways to realize this \r\nreduction. The first involves constructivizing a key result\r\nof Derksen and Makam [DM2] which they developed in order to prove that the null cone\r\nof matrix semi-invariants is cut out by generators whose degree is polynomial in the size of the matrices involved. We also give a second, simpler method to achieve this. This\r\ngives another proof of the polynomial upper bound on the degree of the generators cutting out the null cone of matrix \r\nsemi-invariants.\r\n\r\nBoth the invariant-theoretic result and the algorithmic result rely crucially \r\non the regularity lemma proved in [IQS1]. In \r\nthis paper we improve on the constructive version of the regularity lemma from [IQS1] by removing a technical coprime \r\ncondition that was assumed there.","keywords":["invariant theory","non-commutative rank","null cone","symbolic determinant identity testing","semi-invariants of quivers"],"author":[{"@type":"Person","name":"Ivanyos, G\u00e1bor","givenName":"G\u00e1bor","familyName":"Ivanyos"},{"@type":"Person","name":"Qiao, Youming","givenName":"Youming","familyName":"Qiao"},{"@type":"Person","name":"Subrahmanyam, K Venkata","givenName":"K Venkata","familyName":"Subrahmanyam"}],"position":55,"pageStart":"55:1","pageEnd":"55:19","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Ivanyos, G\u00e1bor","givenName":"G\u00e1bor","familyName":"Ivanyos"},{"@type":"Person","name":"Qiao, Youming","givenName":"Youming","familyName":"Qiao"},{"@type":"Person","name":"Subrahmanyam, K Venkata","givenName":"K Venkata","familyName":"Subrahmanyam"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.55","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9410","name":"The Duality Gap for Two-Team Zero-Sum Games","abstract":"We consider multiplayer games in which the players fall in two teams of size k, with payoffs equal within, and of opposite sign across, the two teams. In the classical case of k=1, such zero-sum games possess a unique value, independent of order of play, due to the von Neumann minimax theorem. However, this fails for all k>1; we can measure this failure by a duality gap, which quantifies the benefit of being the team to commit last to its strategy. In our main result \twe show that the gap equals 2(1-2^{1-k}) for m=2 and 2(1-\\m^{-(1-o(1))k}) for m>2, with m being the size of the action space of each player.\r\nAt a finer level, the cost to a team of individual players acting independently while the opposition employs joint randomness is 1-2^{1-k} for k=2, and 1-\\m^{-(1-o(1))k} for m>2.\r\n\t\r\nThis class of multiplayer games, apart from being a natural bridge between two-player zero-sum games and general multiplayer games, is motivated from Biology (the weak selection model of evolution) and Economics (players with shared utility but poor coordination).","keywords":["multi-player games","duality gap","zero-sum games","evolution"],"author":[{"@type":"Person","name":"Schulman, Leonard","givenName":"Leonard","familyName":"Schulman"},{"@type":"Person","name":"Vazirani, Umesh V.","givenName":"Umesh V.","familyName":"Vazirani"}],"position":56,"pageStart":"56:1","pageEnd":"56:8","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Schulman, Leonard","givenName":"Leonard","familyName":"Schulman"},{"@type":"Person","name":"Vazirani, Umesh V.","givenName":"Umesh V.","familyName":"Vazirani"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.56","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["http:\/\/dx.doi.org\/10.1038\/nature02414","http:\/\/dx.doi.org\/10.1073\/pnas.252626899","http:\/\/dx.doi.org\/10.1371\/journal.pcbi.1003381"],"isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9411","name":"Well-Supported vs. Approximate Nash Equilibria: Query Complexity of Large Games","abstract":"In this paper we present a generic reduction from the problem of finding an \\epsilon-well-supported Nash equilibrium (WSNE) to that of finding an \\Theta(\\epsilon)-approximate Nash equilibrium (ANE), in large games with n players and a bounded number of strategies for each player.\r\nOur reduction complements the existing literature on relations between WSNE and ANE, and can be applied to extend hardness results on WSNE to similar results on ANE.\r\nThis allows one to focus on WSNE first, which is in general easier to analyze and control in hardness constructions.\r\n\r\nAs an application we prove a 2^{\\Omega(n\/\\log n)} lower bound on the randomized query complexity of finding an \\epsilon-ANE in binary-action n-player games, for some constant \\epsilon>0.\r\nThis answers an open problem posed by Hart and Nisan and Babichenko, and is very close to the trivial upper bound of 2^n.\r\nPreviously for WSNE, Babichenko showed a 2^{\\Omega(n)} lower bound on the randomized query complexity of finding an \\epsilon-WSNE for some constant epsilon>0.\r\nOur result follows directly from combining Babichenko's result and our new reduction from WSNE to ANE.","keywords":["Equilibrium Computation","Query Complexity","Large Games"],"author":[{"@type":"Person","name":"Chen, Xi","givenName":"Xi","familyName":"Chen"},{"@type":"Person","name":"Cheng, Yu","givenName":"Yu","familyName":"Cheng"},{"@type":"Person","name":"Tang, Bo","givenName":"Bo","familyName":"Tang"}],"position":57,"pageStart":"57:1","pageEnd":"57:9","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Chen, Xi","givenName":"Xi","familyName":"Chen"},{"@type":"Person","name":"Cheng, Yu","givenName":"Yu","familyName":"Cheng"},{"@type":"Person","name":"Tang, Bo","givenName":"Bo","familyName":"Tang"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.57","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9412","name":"Metatheorems for Dynamic Weighted Matching","abstract":"We consider the maximum weight matching (MWM) problem in dynamic graphs. We provide two reductions. The first reduces the dynamic MWM problem on m-edge, n-node graphs with weights bounded by N to the problem with weights bounded by (n\/eps)^2, so that if the MWM problem can be alpha-approximated with update time t(m,n,N), then it can also be (1+eps)alpha-approximated with update time O(t(m,n,(n\/eps)^2)log^2 n+log n loglog N)). The second reduction reduces the dynamic MWM problem to the dynamic maximum cardinality matching (MCM) problem in which the graph is unweighted. This reduction shows that if there is an \\alpha-approximation algorithm for MCM with update time t(m,n) in m-edge n-node graphs, then there is also a (2+eps)alpha-approximation algorithm for MWM with update time O(t(m,n)eps^{-2}log^2 N). We also obtain better bounds in our reductions if the ratio between the largest and the smallest edge weight is small. Combined with recent work on MCM, these two reductions substantially improve upon the state-of-the-art of dynamic MWM algorithms.","keywords":["dynamic algorithms","maximum matching","maximum weight matching"],"author":[{"@type":"Person","name":"Stubbs, Daniel","givenName":"Daniel","familyName":"Stubbs"},{"@type":"Person","name":"Vassilevska Williams, Virginia","givenName":"Virginia","familyName":"Vassilevska Williams"}],"position":58,"pageStart":"58:1","pageEnd":"58:14","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Stubbs, Daniel","givenName":"Daniel","familyName":"Stubbs"},{"@type":"Person","name":"Vassilevska Williams, Virginia","givenName":"Virginia","familyName":"Vassilevska Williams"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.58","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9413","name":"SOS Is Not Obviously Automatizable, Even Approximately","abstract":"Suppose we want to minimize a polynomial p(x) = p(x_1,...,x_n), subject to some polynomial constraints q_1(x),...,q_m(x) >_ 0, using the Sum-of-Squares (SOS) SDP hierarachy. Assume we are in the \"explicitly bounded\" (\"Archimedean\") case where the constraints include x_i^2 <_ 1 for all 1 <_ i <_ n. It is often stated that the degree-d version of the SOS hierarchy can be solved, to\r\nhigh accuracy, in time n^O(d). Indeed, I myself have stated this in several previous works.\r\n\r\nThe point of this note is to state (or remind the reader) that this is not obviously true. The difficulty comes not from the \"r\" in the Ellipsoid Algorithm, but from the \"R\"; a priori, we only know an exponential upper bound on the number of bits needed to write down the SOS solution. An explicit example is given of a degree-2 SOS program illustrating the difficulty.","keywords":["Sum-of-Squares","semidefinite programming"],"author":{"@type":"Person","name":"O'Donnell, Ryan","givenName":"Ryan","familyName":"O'Donnell"},"position":59,"pageStart":"59:1","pageEnd":"59:10","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":{"@type":"Person","name":"O'Donnell, Ryan","givenName":"Ryan","familyName":"O'Donnell"},"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.59","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["http:\/\/cstheory.stackexchange.com\/questions\/3921\/what-is-the-actual-time-complexity-of-gaussian-elimination","http:\/\/dx.doi.org\/10.1007\/0-387-22444-0_6","http:\/\/www.cs.cmu.edu\/afs\/cs.cmu.edu\/academic\/class\/15859-f11\/www\/notes\/lecture10.pdf"],"isPartOf":"#volume6270"},{"@type":"ScholarlyArticle","@id":"#article9414","name":"The Journey from NP to TFNP Hardness","abstract":"The class TFNP is the search analog of NP with the additional guarantee that any instance has a solution. TFNP has attracted extensive attention due to its natural syntactic subclasses that capture the computational complexity of important search problems from algorithmic game theory, combinatorial optimization and computational topology. Thus, one of the main research objectives in the context of TFNP is to search for efficient algorithms for its subclasses, and at the same time proving hardness results where efficient algorithms cannot exist.\r\n\r\nCurrently, no problem in TFNP is known to be hard under assumptions such as NP hardness, the existence of one-way functions, or even public-key cryptography. The only known hardness results are based on less general assumptions such as the existence of collision-resistant hash functions, one-way permutations less established cryptographic primitives (e.g. program obfuscation or functional encryption).\r\n\r\nSeveral works explained this status by showing various barriers to proving hardness of TFNP. In particular, it has been shown that hardness of TFNP hardness cannot be based on worst-case NP hardness, unless NP=coNP. Therefore, we ask the following question: What is the weakest assumption sufficient for showing hardness in TFNP?\r\n\r\nIn this work, we answer this question and show that hard-on-average TFNP problems can be based on the weak assumption that there exists a hard-on-average language in NP. In particular, this includes the assumption of the existence of one-way functions. In terms of techniques, we show an interesting interplay between problems in TFNP, derandomization techniques, and zero-knowledge proofs.","keywords":["TFNP","derandomization","one-way functions","average-case hardness"],"author":[{"@type":"Person","name":"Hub\u00e1cek, Pavel","givenName":"Pavel","familyName":"Hub\u00e1cek"},{"@type":"Person","name":"Naor, Moni","givenName":"Moni","familyName":"Naor"},{"@type":"Person","name":"Yogev, Eylon","givenName":"Eylon","familyName":"Yogev"}],"position":60,"pageStart":"60:1","pageEnd":"60:21","dateCreated":"2017-11-28","datePublished":"2017-11-28","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode","copyrightHolder":[{"@type":"Person","name":"Hub\u00e1cek, Pavel","givenName":"Pavel","familyName":"Hub\u00e1cek"},{"@type":"Person","name":"Naor, Moni","givenName":"Moni","familyName":"Naor"},{"@type":"Person","name":"Yogev, Eylon","givenName":"Eylon","familyName":"Yogev"}],"copyrightYear":"2017","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.60","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","citation":["http:\/\/www.cambridge.org\/catalogue\/catalogue.asp?isbn=9780521424264","http:\/\/dx.doi.org\/10.1007\/3-540-44647-8_1","http:\/\/dx.doi.org\/10.1137\/S0097539792228289","http:\/\/dx.doi.org\/10.1109\/FOCS.2013.13","http:\/\/www.cs.ox.ac.uk\/people\/paul.goldberg\/papers\/paper-2.pdf","http:\/\/dx.doi.org\/10.1109\/SCT.1995.514853","http:\/\/dx.doi.org\/10.1109\/SFCS.1989.63483","http:\/\/dx.doi.org\/10.1016\/0022-0000(88)90046-3","http:\/\/eprint.iacr.org\/2005\/328","http:\/\/dx.doi.org\/10.1016\/0304-3975(91)90200-L","http:\/\/dx.doi.org\/10.1007\/BF00196774","http:\/\/dx.doi.org\/10.1016\/S0022-0000(05)80063-7","http:\/\/dx.doi.org\/10.1145\/2591796.2591825"],"isPartOf":"#volume6270"}]}