By Topic

Computational Complexity (CCC), 2013 IEEE Conference on

Date 5-7 June 2013

Filter Results

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

    Publication Year: 2013 , Page(s): C4
    Save to Project icon | Request Permissions | PDF file iconPDF (952 KB)  
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2013 , Page(s): i
    Save to Project icon | Request Permissions | PDF file iconPDF (116 KB)  
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2013 , Page(s): iii
    Save to Project icon | Request Permissions | PDF file iconPDF (313 KB)  
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2013 , Page(s): iv
    Save to Project icon | Request Permissions | PDF file iconPDF (120 KB)  
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2013 , Page(s): v - vii
    Save to Project icon | Request Permissions | PDF file iconPDF (137 KB)  
    Freely Available from IEEE
  • Preface

    Publication Year: 2013 , Page(s): viii
    Save to Project icon | Request Permissions | PDF file iconPDF (112 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Organizing Committee

    Publication Year: 2013 , Page(s): ix
    Save to Project icon | Request Permissions | PDF file iconPDF (212 KB)  
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2013 , Page(s): x
    Save to Project icon | Request Permissions | PDF file iconPDF (208 KB)  
    Freely Available from IEEE
  • Reviewers

    Publication Year: 2013 , Page(s): xi
    Save to Project icon | Request Permissions | PDF file iconPDF (83 KB)  
    Freely Available from IEEE
  • CCC 2013 Awards

    Publication Year: 2013 , Page(s): xii
    Save to Project icon | Request Permissions | PDF file iconPDF (86 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Random Arithmetic Formulas Can Be Reconstructed Efficiently

    Publication Year: 2013 , Page(s): 1 - 9
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (247 KB) |  | HTML iconHTML  

    Informally stated, we present here a randomized algorithm that given blackbox access to the polynomial f computed by an unknown/hidden arithmetic formula φ reconstructs, on average, an equivalent or smaller formula φ̂ in time polynomial in the size of its output φ̂. Specifically, we consider arithmetic formulas wherein the underlying tree is a complete binary tre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formulas are Exponentially Stronger than Monotone Circuits in Non-commutative Setting

    Publication Year: 2013 , Page(s): 10 - 14
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (167 KB) |  | HTML iconHTML  

    We give an example of a non-commutative monotone polynomial f which can be computed by a polynomial-size non-commutative formula, but every monotone non-commutative circuit computing f must have an exponential size. In the non-commutative setting this gives, a fortiori, an exponential separation between monotone and general formulas, monotone and general branching programs, and monotone and genera... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Medium-Uniformity and Circuit Lower Bounds

    Publication Year: 2013 , Page(s): 15 - 23
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (270 KB) |  | HTML iconHTML  

    We explore relationships between circuit complexity, the complexity of generating circuits, and algorithms for analyzing circuits. Our results can be divided into two parts: 1. Lower Bounds Against Medium-Uniform Circuits. Informally, a circuit class is “medium uniform” if it can be generated by an algorithmic process that is somewhat complex (stronger than LOGTIME) but not infeasibl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards a Reverse Newman's Theorem in Interactive Information Complexity

    Publication Year: 2013 , Page(s): 24 - 33
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (254 KB) |  | HTML iconHTML  

    Newman's theorem states that we can take any public-coin communication protocol and convert it into one that uses only private randomness with only a little increase in communication complexity. We consider a reversed scenario in the context of information complexity: can we take a protocol that uses private randomness and convert it into one that only uses public randomness while preserving the i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shared Randomness and Quantum Communication in the Multi-party Model

    Publication Year: 2013 , Page(s): 34 - 43
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (246 KB) |  | HTML iconHTML  

    We study shared randomness in the context of multi-party number-in-hand communication protocols in the simultaneous message passing model. We show that with three or more players, shared randomness exhibits new interesting properties that have no direct analogues in the two-party case. First, we demonstrate a hierarchy of modes of shared randomness, with the usual shared randomness where all parti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Power of Non-adaptive Learning Graphs

    Publication Year: 2013 , Page(s): 44 - 55
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (290 KB) |  | HTML iconHTML  

    We introduce a notion of the quantum query complexity of a certificate structure. This is a formalisation of a well-known observation that many quantum query algorithms only require the knowledge of the disposition of possible certificates in the input string, not the precise values therein. Next, we derive a dual formulation of the complexity of a non-adaptive learning graph, and use it to show t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Correct Exponent for the Gotsman-Linial Conjecture

    Publication Year: 2013 , Page(s): 56 - 64
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (245 KB) |  | HTML iconHTML  

    We prove new bounds on the average sensitivity of polynomial threshold functions. In particular, we show the average sensitivity of a polynomial threshold function of constant degree is not much more than the square root of the dimension of its space of definition. This bound amounts to a significant improvement over previous bounds, and in particular, for fixed degree provides the correct asympto... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approaching the Chasm at Depth Four

    Publication Year: 2013 , Page(s): 65 - 73
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (260 KB) |  | HTML iconHTML  

    Agrawal-Vinay [AV08] and Koiran [Koi12] have recently shown that an exp(ω(√n log2 n)) lower bound for depth four homogeneous circuits computing the permanent with bottom layer of × gates having fanin bounded by √n translates to super-polynomial lower bound for general arithmetic circuits computing the permanent. Motivated by this, we examine the complexity of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximating Boolean Functions with Depth-2 Circuits

    Publication Year: 2013 , Page(s): 74 - 85
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (310 KB) |  | HTML iconHTML  

    We study the complexity of approximating Boolean functions with DNFs and other depth-2 circuits, exploring two main directions: universal bounds on the approximability of all Boolean functions, and the approximability of the parity function. In the first direction, our main positive results are the first non-trivial universal upper bounds on appropriability by DNFs: : Every Boolean function can be... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructing Hard Functions Using Learning Algorithms

    Publication Year: 2013 , Page(s): 86 - 97
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (264 KB) |  | HTML iconHTML  

    Fort now and Klivans proved the following relationship between efficient learning algorithms and circuit lower bounds: if a class of boolean circuits C contained in P/poly of Boolean is exactly learnable with membership and equivalence queries in polynomial-time, then EXP^NP is not contained in C (the class EXP^NP was subsequently improved to EXP by Hitchcock and Harkins). In this paper, we improv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Short Lists with Short Programs in Short Time

    Publication Year: 2013 , Page(s): 98 - 108
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (239 KB) |  | HTML iconHTML  

    Given a machine U, a c-short program for x is a string p such that U(p) = x and the length of p is bounded by c + (the length of a shortest program for x). We show that for any universal machine, it is possible to compute in polynomial time on input x a list of polynomial size guaranteed to contain a O(log|x|)-short program for x. We also show that there exist computable functions that map every x... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lower Bounds for DNF-refutations of a Relativized Weak Pigeonhole Principle

    Publication Year: 2013 , Page(s): 109 - 120
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (304 KB) |  | HTML iconHTML  

    The relativized weak pigeonhole principle states that if at least 2n out of n2 pigeons fly into n holes, then some hole must be doubly occupied. We prove that every DNF-refutation of the CNF encoding of this principle requires size 2((log n)3/2-ε) for every ϵ > 0 and every sufficiently large n. For its proof we need to discuss the existence of unbalanced low-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • LS+ Lower Bounds from Pairwise Independence

    Publication Year: 2013 , Page(s): 121 - 132
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (307 KB) |  | HTML iconHTML  

    We consider the complexity of LS+ refutations of unsatisfiable instances of Constraint Satisfaction Problems (k-CSPs) when the underlying predicate supports a pairwise independent distribution on its satisfying assignments. This is the most general condition on the predicates under which the corresponding MAX k-CSP problem is known to be approximation resistant. We show that for random ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Just a Pebble Game

    Publication Year: 2013 , Page(s): 133 - 143
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (267 KB) |  | HTML iconHTML  

    The two-player pebble game of Dymond-Tompa is identified as a barrier for existing techniques to save space or to speed up parallel algorithms for evaluation problems. Many combinatorial lower bounds to study I versus NI and NC versus P under different restricted settings scale in the same way as the pebbling algorithm of Dymond-Tompa. These lower bounds include, (1) the monotone separation of m-I... View full abstract»

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

    Publication Year: 2013 , Page(s): 144 - 155
    Save to Project icon | Request Permissions | Click to expandAbstract | PDF file iconPDF (282 KB) |  | HTML iconHTML  

    We introduce quantum XOR games, a model of two-player one-round games that extends the model of XOR games by allowing the referee's questions to the players to be quantum states. We give examples showing that quantum XOR games exhibit a wide range of behaviors that are known not to exist for standard XOR games, such as cases in which the use of entanglement leads to an arbitrarily large advantage ... View full abstract»

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