Scheduled System Maintenance
On Friday, October 20, IEEE Xplore will be unavailable from 9:00 PM-midnight ET. We apologize for the inconvenience.
Notice: There is currently an issue with the citation download feature. Learn more.

2012 IEEE 27th Conference on Computational Complexity

26-29 June 2012

Filter Results

Displaying Results 1 - 25 of 48
  • [Cover art]

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

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

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

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

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

    Publication Year: 2012, Page(s): ix
    Request permission for commercial reuse | PDF file iconPDF (102 KB) | HTML iconHTML
    Freely Available from IEEE
  • Organizing Committee

    Publication Year: 2012, Page(s): x
    Request permission for commercial reuse | PDF file iconPDF (95 KB)
    Freely Available from IEEE
  • Program Committee

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

    Publication Year: 2012, Page(s):xii - xiii
    Request permission for commercial reuse | PDF file iconPDF (77 KB)
    Freely Available from IEEE
  • Awards

    Publication Year: 2012, Page(s): xiv
    Request permission for commercial reuse | PDF file iconPDF (78 KB)
    Freely Available from IEEE
  • Amplifying Circuit Lower Bounds against Polynomial Time with Applications

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

    We give a self-reduction for the Circuit Evaluation problem (CircEval), and prove the following consequences. · Amplifying Size-Depth Lower Bounds. If CIRCEVAL ϵ SIZEDEPTH [nk, n1-δ] for some k and δ, then for every ε >; 0, there is a δ >; 0, there is a δ' >; 0 such that CIRCEVAL ϵ SIZEDEPTH [nk, n View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Is Valiant-Vazirani's Isolation Probability Improvable?

    Publication Year: 2012, Page(s):10 - 20
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (284 KB) | HTML iconHTML

    The Valiant-Vazirani Isolation Lemma [TCS, vol. 47, pp. 85-93, 1986] provides an efficient procedure for isolating a satisfying assignment of a given satisfiable circuit: Given a Boolean circuit C on n input variables, the procedure outputs a new circuit C' on the same n input variables such that (i) every satisfying assignment of C' also satisfies C, and (ii) if C is satisfiable, then C' has exac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel Approximation of Min-max Problems with Applications to Classical and Quantum Zero-Sum Games

    Publication Year: 2012, Page(s):21 - 31
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (321 KB) | HTML iconHTML

    This paper presents an efficient parallel algorithm for a new class of min-max problems based on the matrix multiplicative weights update method. Our algorithm can be used to find near-optimal strategies for competitive two-player classical or quantum games in which a referee exchanges any number of messages with one player followed by any number of additional messages with the other. This algorit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Complexity of the Separable Hamiltonian Problem

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

    In this paper, we study variants of the canonical Local Hamiltonian problem where, in addition, the witness is promised to be separable. We define two variants of the Local Hamiltonian problem. The input for the Separable Local Hamiltonian problem is the same as the Local Hamiltonian problem, i.e. a local Hamiltonian and two energies a and b, but the question is somewhat different: the answer is Y... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantum Money with Classical Verification

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

    We propose and construct a quantum money scheme that allows verification through classical communication with a bank. This is the first demonstration that a secure quantum money scheme exists that does not require quantum communication for coin verification. Our scheme is secure against adaptive adversaries - this property is not directly related to the possibility of classical verification, never... View full abstract»

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

    Publication Year: 2012, Page(s):53 - 63
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (250 KB) | HTML iconHTML

    Motivated by the pervasiveness of strong inapproximability results for Max-CSPs, we introduce a relaxed notion of an approximate solution of a Max-CSP. In this relaxed version, loosely speaking, the algorithm is allowed to replace the constraints of an instance by some other (possibly real-valued) constraints, and then only needs to satisfy as many of the new constraints as possible. To be more pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reductions between Expansion Problems

    Publication Year: 2012, Page(s):64 - 73
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB) | HTML iconHTML

    The Small-Set Expansion Hypothesis (Raghavendra, Steurer, STOC 2010) is a natural hardness assumption concerning the problem of approximating the edge expansion of small sets in graphs. This hardness assumption is closely connected to the Unique Games Conjecture (Khot, STOC 2002). In particular, the Small-Set Expansion Hypothesis implies the Unique Games Conjecture (Raghavendra, Steurer, STOC 2010... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Problems as Hard as CNF-SAT

    Publication Year: 2012, Page(s):74 - 84
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (298 KB) | HTML iconHTML

    The field of exact exponential time algorithms for NP-hard problems has thrived over the last decade. While exhaustive search remains asymptotically the fastest known algorithm for some basic problems, difficult and non-trivial exponential time algorithms have been found for a myriad of problems, including GRAPH COLORING, HAMILTONIAN PATH, DOMINATING SET and 3-CNF-SAT. In some instances, improving... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Testing List H-homomorphisms

    Publication Year: 2012, Page(s):85 - 95
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (310 KB) | HTML iconHTML

    Let H be an undirected graph. In the List H-Homomorphism Problem, given an undirected graph G with a list constraint L(v) ⊆ V(H) for each variable v ∈ V(G), the objective is to find a list H-homomorphism f:V(G) → V(H), that is, f(v) ∈ L(v) for every v ∈ V(G) and (f(u), f(v)) ∈ E(H) whenever (u, v) ∈ E(G). We consider testing list H-homomorphism: giv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Dichotomy for Real Weighted Holant Problems

    Publication Year: 2012, Page(s):96 - 106
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (285 KB) | HTML iconHTML

    Holant is a framework of counting characterized by local constraints. It is closely related to other well-studied frameworks such as #CSP and Graph Homomorphism. An effective dichotomy for such frameworks can immediately settle the complexity of all combinatorial problems expressible in that framework. Both #CSP and Graph Homomorphism can be viewed as sub-families of Holant with the additional ass... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis

    Publication Year: 2012, Page(s):107 - 116
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (277 KB) | HTML iconHTML

    We present a moderately exponential time algorithm for the satisfiability of Boolean formulas over the full binary basis. For formulas of size at most cn, our algorithm runs in time 2(1-μc)n for some constant μc >; 0. As a byproduct of the running time analysis of our algorithm, we get strong average-case hardness of affine extractors fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximating AC^0 by Small Height Decision Trees and a Deterministic Algorithm for #AC^0SAT

    Publication Year: 2012, Page(s):117 - 125
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (276 KB) | HTML iconHTML

    We show how to approximate any function in AC0 by decision trees of much smaller height than its number of variables. More precisely, we show that any function in n variables computable by an unbounded fan-in circuit of AND, OR, and NOT gates that has size S and depth d can be approximated by a decision tree of height n - βn to within error exp(-βn), where β = ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DNF Sparsification and a Faster Deterministic Counting Algorithm

    Publication Year: 2012, Page(s):126 - 135
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (266 KB) | HTML iconHTML

    We give a faster deterministic algorithm for approximately counting the number of satisfying solutions to a DNF or CNF. Given a DNF(or CNF) f on n variables and poly(n) terms, we give a deterministic nÕ((log log n)2) time algorithm that computes an (additive) ε approximation to the fraction of satisfying assignments of f for ε = 1/poly(logn). ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Communication Complexity and Information Complexity: Foundations and New Directions

    Publication Year: 2012, Page(s): 136
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (180 KB) | HTML iconHTML

    In this talk, we will survey exciting new developments and applications in communication complexity and information complexity. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Gaussian Noise Sensitivity and Fourier Tails

    Publication Year: 2012, Page(s):137 - 147
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (325 KB) | HTML iconHTML

    We study the problem of matrix isomorphism of matrix Lie algebras (MatIsoLie). Lie algebras arise centrally in areas as diverse as differential equations, particle physics, group theory, and the Mulmuley -- Sohoni Geometric Complexity Theory program. A matrix Lie algebra is a set L of matrices that is closed under linear combinations and the operation [A, B] = AB - BA. Two matrix Lie algebras L, L... View full abstract»

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