2015 IEEE 56th Annual Symposium on Foundations of Computer Science

17-20 Oct. 2015

Filter Results

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

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

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

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

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

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

    Publication Year: 2015, Page(s): xii
    Request permission for commercial reuse | PDF file iconPDF (60 KB) | HTML iconHTML
    Freely Available from IEEE
  • Organizing Committee and Sponsors

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

    Publication Year: 2015, Page(s): xiv
    Request permission for commercial reuse | PDF file iconPDF (56 KB)
    Freely Available from IEEE
  • External Reviewers

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

    Publication Year: 2015, Page(s): xxi
    Request permission for commercial reuse | PDF file iconPDF (59 KB)
    Freely Available from IEEE
  • Approximating ATSP by Relaxing Connectivity

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

    The standard LP relaxation of the asymmetric traveling salesman problem has been conjectured to have a constant integrality gap in the metric case. We prove this conjecture when restricted to shortest path metrics of node-weighted digraphs. Our arguments are constructive and give a constant factor approximation algorithm for these metrics. We remark that the considered case is more general than th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Effective-Resistance-Reducing Flows, Spectrally Thin Trees, and Asymmetric TSP

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

    We show that the integrality gap of the natural LP relaxation of the Asymmetric Traveling Salesman Problem is polyloglog(n). In other words, there is a polynomial time algorithm that approximates the value of the optimum tour within a factor of polyloglog(n), where polyloglog(n) is a bounded degree polynomial of loglog(n). We prove this by showing that any k-edge-connected unweighted graph has a p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Compressing and Teaching for Low VC-Dimension

    Publication Year: 2015, Page(s):40 - 51
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (246 KB) | HTML iconHTML

    In this work we study the quantitative relation between VC-dimension and two other basic parameters related to learning and teaching. Namely, the quality of sample compression schemes and of teaching sets for classes of low VC-dimension. Let C be a binary concept class of size m and VC-dimension d. Prior to this work, the best known upper bounds for both parameters were log(m), while the best lowe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Monotonicity Testing and Boolean Isoperimetric Type Theorems

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

    We show a directed and robust analogue of a boolean isoperimetric type theorem of Talagrand [13]. As an application, we give a monotonicity testing algorithm that makes O̅(√n/ε2) non-adaptive queries to a function f : {0, 1}n → {0, 1}, always accepts a monotone function and rejects a function that is ε-far from being monotone with constant p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tight Hardness Results for LCS and Other Sequence Similarity Measures

    Publication Year: 2015, Page(s):59 - 78
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (331 KB) | HTML iconHTML

    Two important similarity measures between sequences are the longest common subsequence (LCS) and the dynamic time warping distance (DTWD). The computations of these measures for two given sequences are central tasks in a variety of applications. Simple dynamic programming algorithms solve these tasks in O(n2) time, and despite an extensive amount of research, no algorithms with signific... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping

    Publication Year: 2015, Page(s):79 - 97
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (561 KB) | HTML iconHTML

    Classic similarity measures of strings are longest common subsequence and Levenshtein distance (i.e., the classic edit distance). A classic similarity measure of curves is dynamic time warping. These measures can be computed by simple O(n2) dynamic programming algorithms, and despite much effort no algorithms with significantly better running time are known. We prove that, even restrict... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • If the Current Clique Algorithms are Optimal, So is Valiant's Parser

    Publication Year: 2015, Page(s):98 - 117
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (340 KB) | HTML iconHTML

    The CFG recognition problem is: given a context-free grammar G and a string w of length n, decide if w can be obtained from G. This is the most basic parsing question and is a core computer science problem. Valiant's parser from 1975 solves the problem in O(nO) time, where ? <; 2:373 is the matrix multiplication exponent. Dozens of parsing algorithms have been proposed over the years, yet Valia... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Language Edit Distance and Maximum Likelihood Parsing of Stochastic Grammars: Faster Algorithms and Connection to Fundamental Graph Problems

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

    Given a context free language G over alphabet Σ and a string s ∈ Σ*, the language edit distance problem seeks the minimum number of edits (insertions, deletions and substitutions) required to convert s into a valid member of the language £(G). The well-known dynamic programming algorithm solves this problem in O(n3) time (ignoring grammar size) where n is the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Probabilistic Polynomials and Hamming Nearest Neighbors

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

    We show how to compute any symmetric Boolean function on n variables over any field (as well as '/ the integers) with a probabilistic polynomial of degree O( √nlog(1/ε)) and error at most ε. The degree dependence on n and ε is optimal, matching a lower bound of Razborov (1987) and Smolensky (1987) for the MAJORITY function. The proof is constructive: a low-degree polyno... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Indistinguishability Obfuscation from the Multilinear Subgroup Elimination Assumption

    Publication Year: 2015, Page(s):151 - 170
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (323 KB) | HTML iconHTML

    We revisit the question of constructing secure general-purpose indistinguishability obfuscation, with a security reduction based on explicit computational assumptions over multilinear maps. Previous to our work, such reductions were only known to exist based on meta-assumptions and/or ad-hoc assumptions: In the original constructive work of Garg et al. (FOCS 2013), the underlying explicit computat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Indistinguishability Obfuscation from Functional Encryption

    Publication Year: 2015, Page(s):171 - 190
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (302 KB) | HTML iconHTML

    Indistinguishability obfuscation (IO) is a tremendous notion, powerful enough to give rise to almost any known cryptographic object. So far, candidate IO constructions were based on specific assumptions on algebraic objects called multi-linear graded encodings. We present a generic construction of indistinguishability obfuscation from public-key functional encryption with succinct cipher texts and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Limits on the Power of Indistinguishability Obfuscation and Functional Encryption

    Publication Year: 2015, Page(s):191 - 209
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (325 KB) | HTML iconHTML

    Recent breakthroughs in cryptography have positioned indistinguishability obfuscation as a "central hub" for almost all known cryptographic tasks, and as an extremely powerful building block for new cryptographic tasks resolving long-standing and foundational open problems. However, constructions based on indistinguishability obfuscation almost always rely on non-black-box techniques, and thus the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Black-Box Garbled RAM

    Publication Year: 2015, Page(s):210 - 229
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (341 KB) | HTML iconHTML

    Garbled RAM, introduced by Lu and Ostrovsky, enables the task of garbling a RAM (Random Access Machine) program directly, there by avoiding the inefficient process of first converting it into a circuit. Garbled RAM can be seen as a RAM analogue of Yao's garbled circuit construction, except that known realizations of Garbled RAM make non-black-box use of the underlying cryptographic primitives. In ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Inverse Maintenance and Faster Algorithms for Linear Programming

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

    In this paper, we consider the following inverse maintenance problem: given A ∈ Rn×d and a number of rounds r, at round k, we receive a n x n diagonal matrix D(k) and we wish to maintain an efficient linear system solver for ATD(k)A under the assumption D(k) does not change too rapidly. This inverse maintenance problem is the com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time

    Publication Year: 2015, Page(s):250 - 269
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (301 KB) | HTML iconHTML

    We present the first almost-linear time algorithm for constructing linear-sized spectral sparsification for graphs. This improves all previous constructions of linear-sized spectral sparsification, which requires Ω(n2) time [1], [2], [3]. A key ingredient in our algorithm is a novel combination of two techniques used in literature for constructing spectral sparsification: Random ... View full abstract»

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