2014 IEEE 29th Conference on Computational Complexity (CCC)

11-13 June 2014

Filter Results

Displaying Results 1 - 25 of 42
  • [Front cover]

    Publication Year: 2014, Page(s): C4
    Request permission for commercial reuse | PDF file iconPDF (555 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2014, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (129 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2014, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (149 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2014, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (121 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2014, Page(s):v - vii
    Request permission for commercial reuse | PDF file iconPDF (133 KB)
    Freely Available from IEEE
  • Preface

    Publication Year: 2014, Page(s): viii
    Request permission for commercial reuse | PDF file iconPDF (60 KB) | HTML iconHTML
    Freely Available from IEEE
  • Committee Lists

    Publication Year: 2014, Page(s): ix
    Request permission for commercial reuse | PDF file iconPDF (77 KB)
    Freely Available from IEEE
  • CCC 2014 Awards: 2014 Ronald V. Book Prize for the Best Student Paper

    Publication Year: 2014, Page(s): x
    Request permission for commercial reuse | PDF file iconPDF (75 KB)
    Freely Available from IEEE
  • Reviewers

    Publication Year: 2014, Page(s):xi - xii
    Request permission for commercial reuse | PDF file iconPDF (60 KB)
    Freely Available from IEEE
  • Goldreich's PRG: Evidence for Near-Optimal Polynomial Stretch

    Publication Year: 2014, Page(s):1 - 12
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (302 KB) | HTML iconHTML

    Furthering the study of cryptography in constant parallel time, we give new evidence for the security of Gold Reich's candidate pseudorandom generator with near-optimal, polynomial stretch. Our evidence consists both of security against sub exponential-time linear attacks as well as sub exponential-time attacks using SDP hierarchies such as Sherali-Adams+ and Lasserre/Parrilo. More specifically, i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Power of Symmetric LP and SDP Relaxations

    Publication Year: 2014, Page(s):13 - 21
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (219 KB) | HTML iconHTML

    We study the computational power of general symmetric relaxations for combinatorial optimization problems, both in the linear programming (LP) and semidefinite programming (SDP) case. We show new connections to explicit LP and SDP relaxations, like those obtained from standard hierarchies. Concretely, for k <; n/4, we show that k-rounds of sum-of squares / Lasserre relaxations of size k(k<... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantum Algorithms for Learning Symmetric Juntas via Adversary Bound

    Publication Year: 2014, Page(s):22 - 31
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB) | HTML iconHTML

    In this paper, we study the following variant of the junta learning problem. We are given oracle access to a Boolean function f on n variables that only depends on k variables, and, when restricted to them, equals some predefined function h. The task is to identify the variables the function depends on. This is a generalisation of the Bernstein-Vazirani problem [1] (when h is the XOR function) and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Physical Problems that are Slightly More Difficult than QMA

    Publication Year: 2014, Page(s):32 - 43
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB) | HTML iconHTML

    We study the complexity of computational problems from quantum physics. Typically, they are studied using the complexity class QMA (quantum counterpart of NP) but some natural computational problems appear to be slightly harder than QMA. We introduce new complexity classes consisting of problems that are solvable with a small number of queries to a QMA oracle and use these complexity classes to qu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • AM with Multiple Merlins

    Publication Year: 2014, Page(s):44 - 55
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (323 KB) | HTML iconHTML

    We introduce and study a new model of interactive proofs: AM(k), or Arthur-Merlin with k non-communicating Merlins. Unlike with the better-known MIP, here the assumption is that each Merlin receives an independent random challenge from Arthur. One motivation for this model (which we explore in detail) comes from the close analogies between it and the quantum complexity class QMA(k), but the AM(k) ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Counting List Matrix Partitions of Graphs

    Publication Year: 2014, Page(s):56 - 65
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (227 KB) | HTML iconHTML

    Given a symmetric DxD matrix M over {0, 1, *}, a list M-partition of a graph G is a partition of the vertices of G into D parts which are associated with the rows of M. The part of each vertex is chosen from a given list in such a way that no edge of G is mapped to a 0 in M and no non-edge of G is mapped to a 1 in M. Many important graph-theoretic structures can be represented as list M-partitions... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Counting the Number of Perfect Matchings in K5-Free Graphs

    Publication Year: 2014, Page(s):66 - 77
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (309 KB) | HTML iconHTML

    Counting the number of perfect matchings in arbitrary graphs is a #P-complete problem. However, for some restricted classes of graphs the problem can be solved efficiently. In the case of planar graphs, and even for K<sub>3,3</sub>-free graphs, Vazirani showed that it is in NC<sup>2</sup>. The technique there is to compute a Pfaffian orientation of a graph. In the case of K... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hardness of Finding Independent Sets in 2-Colorable Hypergraphs and of Satisfiable CSPs

    Publication Year: 2014, Page(s):78 - 89
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB) | HTML iconHTML

    This work revisits the PCP Verifiers used in the works of Hastad [1], Guruswami et al. [2], Holmerin [3] and Guruswami [4] for satisfiable MAX-E3-SAT and MAX-EkSET-SPLITTING, and independent set in 2-colorable 4-uniform hypergraphs. We provide simpler and more efficient PCP Verifiers to prove the following improved hardness results: Assuming that NP ⊈ DTIME(NO(log log N)), . There is no... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Locally Dense Codes

    Publication Year: 2014, Page(s):90 - 97
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (226 KB) | HTML iconHTML

    The Minimum Distance Problem (MDP), i.e., the computational task of evaluating (exactly or approximately) the minimum distance of a linear code, is a well known NP-hard problem in coding theory. A key element in essentially all known proofs that MDP is NP-hard is the construction of a combinatorial object that we may call a locally dense code. This is a linear code with large minimum distance d th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Closest Vector Problem with a Distance Guarantee

    Publication Year: 2014, Page(s):98 - 109
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (373 KB) | HTML iconHTML

    We present a new efficient algorithm for the search version of the approximate Closest Vector Problem with Preprocessing (CVPP). Our algorithm achieves an approximation factor of O(n/√log n), improving on the previous best of O(n1.5) due to Lag arias, Lenstra, and Schnorr [1]. We also show, somewhat surprisingly, that only O(n) vectors of preprocessing advice are sufficient to solve the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithms for Group Isomorphism via Group Extensions and Cohomology

    Publication Year: 2014, Page(s):110 - 119
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (450 KB) | HTML iconHTML

    The isomorphism problem for groups given by their multiplication tables (GPI) has long been known to be solvable in n<sup>O(log n)</sup> time, but only recently has there been significant progress towards polynomial time. For example, Babai et al. (ICALP 2012) gave a polynomial-time algorithm for groups with no abelian normal subgroups. Thus, at present it is crucial to understand grou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Low Influence Functions over Slices of the Boolean Hypercube Depend on Few Coordinates

    Publication Year: 2014, Page(s):120 - 131
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (276 KB) | HTML iconHTML

    One of the classic results in analysis of Boolean functions is a result of Friedgut~cite{Fri98} that states that Boolean functions over the hypercube of low influence are approximately juntas, functions which are determined by few coordinates. While this result has also been extended to product distributions, not much is known in the case of nonproduct distributions. We generalize this result to s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Sum of L1 Influences

    Publication Year: 2014, Page(s):132 - 143
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (299 KB) | HTML iconHTML

    For a function f over the discrete cube, the total L1 influence of f is defined as the sum of the L1 norm of the discrete derivatives of f in all n directions. In this work, we show that in the case of bounded functions this quantity can be upper bounded by a polynomial in the degree of f (independently of dimension n), resolving affirmatively an open problem of Aaronson and Ambainis (ITCS 2011). ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Composition Theorem for Parity Kill Number

    Publication Year: 2014, Page(s):144 - 154
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (305 KB) | HTML iconHTML

    In this work, we study the parity complexity measures Cmin⊕[f] and DT⊕[f]. Cmin⊕[f] is the parity kill number of f, the fewest number of parities on the input variables one has to fix in order to "kill" f, i.e. To make it constant. DT⊕[f] is the depth of the shortest parity decision tree which computes f. These complexity measures h... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recent Progress on Lower Bounds for Arithmetic Circuits

    Publication Year: 2014, Page(s):155 - 160
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (182 KB) | HTML iconHTML

    In recent years there has been much exciting progress on depth reduction of arithmetic circuits and lower bounds for bounded depth arithmetic circuits. We will survey some of these results and highlight some of the main challenges and open questions that remain. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hitting Sets for Low-Degree Polynomials with Optimal Density

    Publication Year: 2014, Page(s):161 - 168
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (257 KB) | HTML iconHTML

    We give a length-efficient puncturing of Reed-Muller codes which preserves its distance properties. Formally, for the Reed-Muller code encoding n-variate degree-d polynomials over Fqwith q ≳ d/δ, we present an explicit (multi)-set S ⊆ Fqnof size N=poly(nd/δ) such that every nonzero polynomial vanishes on at most delta N points in S. Equivalently, we give... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.