2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)

9-11 Oct. 2016

Filter Results

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

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

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

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

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

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

    Publication Year: 2016, Page(s): xiii
    Request permission for commercial reuse | PDF file iconPDF (93 KB)
    Freely Available from IEEE
  • Organizing Committee and Sponsors

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

    Publication Year: 2016, Page(s): xv
    Request permission for commercial reuse | PDF file iconPDF (83 KB)
    Freely Available from IEEE
  • External reviewers

    Publication Year: 2016, Page(s):xvi - xviii
    Request permission for commercial reuse | PDF file iconPDF (107 KB)
    Freely Available from IEEE
  • FOCS 2016 Awards [2 awards]

    Publication Year: 2016, Page(s): xix
    Request permission for commercial reuse | PDF file iconPDF (93 KB)
    Freely Available from IEEE
  • Bounded-Communication Leakage Resilience via Parity-Resilient Circuits

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

    We consider the problem of distributing a computation between two parties, such that any bounded-communication leakage function applied to the local views of the two parties reveals essentially nothing about the input. This problem can be motivated by the goal of outsourcing computations on sensitive data to two servers in the cloud, where both servers can be simultaneously corrupted by viruses th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Indistinguishability Obfuscation from DDH-Like Assumptions on Constant-Degree Graded Encodings

    Publication Year: 2016, Page(s):11 - 20
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (261 KB) | HTML iconHTML

    All constructions of general purpose indistinguishability obfuscation (IO) rely on either meta-assumptions that encapsulate an exponential family of assumptions (e.g., Pass, Seth and Telang, CRYPTO 2014 and Lin, EUROCRYPT 2016), or polynomial families of assumptions on graded encoding schemes with a high polynomial degree/multilinearity (e.g., Gentry, Lewko, Sahai and Waters, FOCS 2014). We presen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Breaking the Three Round Barrier for Non-malleable Commitments

    Publication Year: 2016, Page(s):21 - 30
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (233 KB) | HTML iconHTML

    We construct two-message non-malleable commitments with respect to opening in the standard model, assuming only one-to-one one-way functions. Our protocol consists of two unidirectional messages by the committer (with no message from the receiver), and is secure against all polynomial-time adversaries in the standard synchronous setting. Pass (TCC 2013) proved that any commitment scheme with non-m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Zero-Knowledge Proof Systems for QMA

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

    Prior work has established that all problems in NP admit classical zero-knowledge proof systems, and under reasonable hardness assumptions for quantum computations, these proof systems can be made secure against quantum attacks. We prove a result representing a further quantum generalization of this fact, which is that every problem in the complexity class QMA has a quantum zero-knowledge proof sy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Strong Fooling Sets for Multi-player Communication with Applications to Deterministic Estimation of Stream Statistics

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

    We develop a paradigm for studying multi-player deterministic communication, based on a novel combinatorial concept that we call a strong fooling set. Our paradigm leads to optimal lower bounds on the per-player communication required for solving multi-player EQUALITY problems in a private-message setting. This in turn gives a very strong - O(1) versus Ω(n) - separation between private-mess... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Edit Distance: Sketching, Streaming, and Document Exchange

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

    We show that in the document exchange problem, where Alice holds x ϵ {0, 1}n and Bob holds y ϵ {0, 1}n, Alice can send Bob a message of size O(K(log2 K + log n)) bits such that Bob can recover x using the message and his input y if the edit distance between x and y is no more than K, and output "error" otherwise. Both the encoding and decoding can be ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Heavy Hitters via Cluster-Preserving Clustering

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

    In the turnstile ℓp heavy hitters problem with parameter ε, one must maintain a high-dimensional vector x ∈ ℝn subject to updates of the form update (i,Δ) causing the change xi ← xi + Δ, where i ε[n], Δ ∈ ℝ. Upon receiving a query, the goal is to report every "heavy hitter" i &#... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Quantile Approximation in Streams

    Publication Year: 2016, Page(s):71 - 78
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (249 KB) | HTML iconHTML

    This paper resolves one of the longest standing basic problems in the streaming computational model. Namely, optimal construction of quantile sketches. An ε approximate quantile sketch receives a stream of items x1,⋯,xn and allows one to approximate the rank of any query item up to additive error ε n with probability at least 1-δ.The rank of a query x is the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Average-Case Depth Hierarchy Theorem for Higher Depth

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

    We extend the recent hierarchy results of Rossman, Servedio and Tan [1] to address circuits of almost logarithmic depth. Our proof uses the same basic approach as [1] but a number of small differences enables us to obtain a stronger result by a significantly shorter proof. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit Function

    Publication Year: 2016, Page(s):89 - 98
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (254 KB) | HTML iconHTML

    We consider Boolean circuits over the full binary basis. We prove a (3+1/86)n-o(n) lower bound on the size of such a circuit for an explicitly defined predicate, namely an affine disperser for sublinear dimension. This improves the 3n-o(n) bound of Norbert Blum (1984).The proof is based on the gate elimination technique extended with the following three ideas. We generalize the computational model... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Depth-Reduction for Composites

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

    We obtain a new depth-reduction construction, which implies a super-exponential improvement in the depth lower bound separating NEXP from non-uniform ACC. In particular, we show that every circuit with AND, OR, NOT, and MODm gates, m ε Z+, of polynomial size and depth d can be reduced to a depth-2, SYM-AND, circuit of size 2(log n)O(d). This is an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Deterministic Polynomial Time Algorithm for Non-commutative Rational Identity Testing

    Publication Year: 2016, Page(s):109 - 117
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (331 KB) | HTML iconHTML

    Symbolic matrices in non-commuting variables, and the related structural and algorithmic questions, have a remarkable number of diverse origins and motivations. They arise independently in (commutative) invariant theory and representation theory, linear algebra, optimization, linear system theory, quantum information theory, and naturally in non-commutative algebra. In this paper we present a dete... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Salesman's Improved Paths: A 3/2+1/34 Approximation

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

    We give a new, strongly polynomial algorithm and improved analysis of the metric s-t path TSP. It finds a tour of cost less than 1.53 times the optimum of the subtour elimination LP, while known examples show that 1.5 is a lower bound for the integrality gap. A key new idea is the deletion of some edges of Christofides' trees, and we show that the arising "reconnection" problems can be solved for ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths

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

    A (β, ∈)-hopset for a weighted undirected n-vertex graph G = (V, E) is a set of edges, whose addition to the graph guarantees that every pair of vertices has a path between them that contains at most β edges, whose length is within 1 + ∈ of the shortest path. In her seminal paper, Cohen [8, JACM 2000] introduced the notion of hopsets in the context of parallel computati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Better Unrelated Machine Scheduling for Weighted Completion Time via Random Offsets from Non-uniform Distributions

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

    In this paper we consider the classic scheduling problem of minimizing total weighted completion time on unrelated machines when jobs have release times, i.e, R|rij| Σj wjCj using the three-field notation. For this problem, a 2-approximation is known based on a novel convex programming (J. ACM 2001 by Skutella). It has been a long standing open pr... View full abstract»

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