By Topic

Computational Complexity (CCC), 2010 IEEE 25th Annual Conference on

Date 9-12 June 2010

Filter Results

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

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

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

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

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

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

    Publication Year: 2010, Page(s): viii
    Request permission for commercial reuse | PDF file iconPDF (86 KB) | HTML iconHTML
    Freely Available from IEEE
  • Committees

    Publication Year: 2010, Page(s): ix
    Request permission for commercial reuse | PDF file iconPDF (95 KB)
    Freely Available from IEEE
  • list-reviewer

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

    Publication Year: 2010, Page(s): xi
    Request permission for commercial reuse | PDF file iconPDF (68 KB)
    Freely Available from IEEE
  • Parallel Repetition of Two Prover Games (Invited Survey)

    Publication Year: 2010, Page(s):3 - 6
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (238 KB) | HTML iconHTML

    The parallel repetition theorem states that for any two-prover game with value smaller than 1, parallel repetition reduces the value of the game in an exponential rate. We give a short introduction to the problem of parallel repetition of two-prover games and some of its applications in theoretical computer science, mathematics and physics. We will concentrate mainly on recent results. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • No Strong Parallel Repetition with Entangled and Non-signaling Provers

    Publication Year: 2010, Page(s):7 - 15
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (283 KB) | HTML iconHTML

    We consider one-round games between a classical verifier and two provers. One of the main questions in this area is the parallel repetition question: If the game is played H times in parallel, does the maximum winning probability decay exponentially in ℓ? In the classical setting, this question was answered in the affirmative by Raz. More recently the question arose whether the decay is of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Derandomized Parallel Repetition of Structured PCPs

    Publication Year: 2010, Page(s):16 - 27
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (405 KB) | HTML iconHTML

    A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return is allowed to err with some bounded probability. The probability that the verifier accepts a false proof is called the soundness error, and is an important parameter of a PCP system that one seeks to minimize. Constructi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Derandomized Parallel Repetition Theorems for Free Games

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

    Raz's parallel repetition theorem together with improvements of Holenstein shows that for any two-prover one-round game with value at most 1 - ∈ (for ∈ ≤ 1/2), the value of the game repeated n times in parallel on independent inputs is at most (1-∈)Ω(∈2n/ℓ) where ℓ is the answer length of the game. For free ga... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds

    Publication Year: 2010, Page(s):38 - 49
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB) | HTML iconHTML

    We show that if Arthur-Merlin protocols can be derandomized, then there is a Boolean function computable in deterministic exponential-time with access to an NP oracle, that cannot be computed by Boolean circuits of exponential size. More formally, if prAM ⊆ PNP then there is a Boolean function in ENP that requires circuits of size 2Ω(n). prAM is the c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simple Affine Extractors Using Dimension Expansion

    Publication Year: 2010, Page(s):50 - 57
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (385 KB) | HTML iconHTML

    Let Fq be the field of q elements. An (n, k)-affine extractor is a mapping D : Fqn→ {0,1} such that for any k-dimensional affine subspace X ⊆ Fqn, D(x) is an almost unbiased bit when x is chosen uniformly from X. Loosely speaking, the problem of explicitly constructing affine extractors gets harder as q gets smaller and easier as... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Derandomizing from Random Strings

    Publication Year: 2010, Page(s):58 - 63
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (329 KB) | HTML iconHTML

    In this paper we show that BPP is truth-table reducible to the set of Kolmogorov random strings RK. It was previously known that PSPACE, and hence BPP is Turing-reducible to RK. The earlier proof relied on the adaptivity of the Turing-reduction to find a Kolmogorov-random string of polynomial length using the set RK as oracle. Our new non-adaptive result relies on ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Power of Randomized Reductions and the Checkability of SAT

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

    We prove new results regarding the complexity of various complexity classes under randomized oracle reductions. We first prove that BPPPSZK ⊆ AM ∩ coAM, where PSZK is the class of promise problems having statistical zero knowledge proofs. This strengthens the previously known facts that PSZK is closed under NC1 truth-table reductions (Sahai and Vadhan, J. ACM '0... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP

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

    We investigate the question of what languages can be decided efficiently with the help of a recursive collision-finding oracle. Such an oracle can be used to break collision-resistant hash functions or, more generally, statistically hiding commitments. The oracle we consider, Samd where d is the recursion depth, is based on the identically-named oracle defined in the work of Haitner et ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Program-Enumeration Bottleneck in Average-Case Complexity Theory

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

    Three fundamental results of Levin involve algorithms or reductions whose running time is exponential in the length of certain programs. We study the question of whether such dependency can be made polynomial. 1) Levin's "optimal search algorithm" performs at most a constant factor more slowly than any other fixed algorithm. The constant, however, is exponential in the length of the competing algo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Unique Games Conjecture (Invited Survey)

    Publication Year: 2010, Page(s):99 - 121
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (439 KB) | HTML iconHTML

    This article surveys recently discovered connections between the Unique Games Conjecture and computational complexity, algorithms, discrete Fourier analysis, and geometry. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spectral Algorithms for Unique Games

    Publication Year: 2010, Page(s):122 - 130
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (379 KB) | HTML iconHTML

    We present a new algorithm for Unique Games which is based on purely spectral techniques, in contrast to previous work in the area, which relies heavily on semidefinite programming (SDP). Given a highly satisfiable instance of Unique Games, our algorithm is able to recover a good assignment. The approximation guarantee depends only on the completeness of the game, and not on the alphabet size, whi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources

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

    Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem is equivalent to the NL vs L problem. This paper focuses on the reachability problem over planar graphs where the complexity is unknown. Showing that the planar reachability problem is NL-complete would show that nondete... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Matching Problem for Special Graph Classes

    Publication Year: 2010, Page(s):139 - 150
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (356 KB) | HTML iconHTML

    An even cycle in a graph is called nice by Lovász and Plummer in [LP86] if the graph obtained by deleting all vertices of the cycle has some perfect matching. In the present paper we prove some new complexity bounds for various versions of problems related to perfect matchings in graphs with a polynomially bounded number of nice cycles. We show that for graphs with a polynomially bounded n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Relative Strength of Pebbling and Resolution

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

    The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof systems when comparing the strength of different subsystems, showing bounds on proof space, and establishing size-space trade-offs. The typical approach has been to encode the pebble game played on a graph as a CNF formula an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Trade-Off Lower Bounds for Stack Machines

    Publication Year: 2010, Page(s):163 - 171
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (336 KB) | HTML iconHTML

    A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a logarithmic space bound have been connected to other classical models of computation, such as polynomial time Turing Machines (P) (Cook; 1971) and polynomial size, polylogarithmic depth, bounded fan-in circuits (NC) e.g., ... View full abstract»

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