2014 IEEE 55th Annual Symposium on Foundations of Computer Science

18-21 Oct. 2014

Filter Results

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

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

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

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

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

    Publication Year: 2014, Page(s):v - ix
    Request permission for commercial reuse | PDF file iconPDF (153 KB)
    Freely Available from IEEE
  • Foreword

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

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

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

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

    Publication Year: 2014, Page(s): xvi
    Request permission for commercial reuse | PDF file iconPDF (73 KB)
    Freely Available from IEEE
  • (2 + epsilon)-Sat Is NP-Hard

    Publication Year: 2014, Page(s):1 - 10
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (332 KB) | HTML iconHTML

    We prove the following hardness result for anatural promise variant of the classical CNF-satisfiabilityproblem: Given a CNF-formula where each clause has widthw and the guarantee that there exists an assignment satisfyingat least g = [w/2] - 1 literals in each clause, it is NP-hard tofind a satisfying assignment to the formula (that sets at leastone literal to true in each clause). On the other ha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Counter-example to Karlin's Strong Conjecture for Fictitious Play

    Publication Year: 2014, Page(s):11 - 20
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (305 KB) | HTML iconHTML

    Fictitious play is a natural dynamic for equilibrium play in zero-sum games, proposed by Brown [6], and shown to converge by Robinson [33]. Samuel Karlin conjectured in 1959 that fictitious play converges at rate O(t-1/2) with respect to the number of steps t. We disprove this conjecture by showing that, when the payoff matrix of the row player is the n × n identity matrix, ficti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Simple and Approximately Optimal Mechanism for an Additive Buyer

    Publication Year: 2014, Page(s):21 - 30
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (434 KB) | HTML iconHTML

    We consider a monopolist seller with n heterogeneous items, facing a single buyer. The buyer hasa value for each item drawn independently according to(non-identical) distributions, and his value for a set ofitems is additive. The seller aims to maximize his revenue.It is known that an optimal mechanism in this setting maybe quite complex, requiring randomization [19] and menusof infinite size [15]... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Achieving Target Equilibria in Network Routing Games without Knowing the Latency Functions

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

    The analysis of network routing games typically assumes, right at the onset, precise and detailed information about the latency functions. Such information may, however, be unavailable or difficult to obtain. Moreover, one is often primarily interested in enforcing a desirable target flow as the equilibrium by suitably influencing player behavior in the routing game. We ask whether one can achieve... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Algebraic Approach to Non-malleability

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

    In their seminal work on non-malleable cryptography, Dolev, Dwork and Naor, showed how to construct a non-malleable commitment with logarithmically-many "rounds"/"slots", the idea being that any adversary may successfully maul in some slots but would fail in at least one. Since then new ideas have been introduced, ultimately resulting in constant-round protocols based on any one-way function. Yet,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Automatic Inequality Prover and Instance Optimal Identity Testing

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

    We consider the problem of verifying the identity of a distribution: Given the description of a distribution over a discrete support p = (p1, p2, ... , pn), how many samples (independent draws) must one obtain from an unknown distribution, q, to distinguish, with high probability, the case that p = q from the case that the total variation distance (L1 di... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas

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

    We show here a 2Ω(√d·log N) size lower bound for homogeneous depth four arithmetic formulas. That is, we give an explicit family of polynomials of degree d on N variables (with N = d3 in our case) with 0, 1-coefficients such that for any representation of a polynomial f in this family of the form f = Σi Πj Qij View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Barriers to Near-Optimal Equilibria

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

    This paper explains when and how communication and computational lower bounds for algorithms for an optimization problem translate to lower bounds on the worst-case quality of equilibria in games derived from the problem. We give three families of lower bounds on the quality of equilibria, each motivated by a different set of problems: congestion, scheduling, and distributed welfare games, welfare... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bi-Lipschitz Bijection between the Boolean Cube and the Hamming Ball

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

    We construct a bi-Lipschitz bijection from the Boolean cube to the Hamming ball of equal volume. More precisely, we show that for all even n E N there exists an explicit bijection ψ: {0, 1}n → {x E {0, 1}n+1 : |x| > n/2} such that for every x ≠ y E {0, 1}n+1 it holds that 1/5 ≤ dist(ψ(x), ψ(y)) ≤ 4 5 - dist(x, y) where dist(... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds on the Permanent and Some Applications

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

    We give new lower and upper bounds on the permanent of a doubly stochastic matrix. Combined with previous work, this improves on the deterministic approximation factor. We also give a combinatorial application of the lower bound, proving S. Friedland's "Asymptotic Lower Matching Conjecture"for the monomer-dimer problem. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Chasing Ghosts: Competing with Stateful Policies

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

    We consider sequential decision making in a setting where regret is measured with respect to a set of stateful reference policies, and feedback is limited to observing the rewards of the actions performed (the so called “bandit” setting). If either the reference policies are stateless rather than stateful, or the feedback includes the rewards of all actions (the so called “exp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Circuit Complexity, Proof Complexity, and Polynomial Identity Testing

    Publication Year: 2014, Page(s):110 - 119
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (325 KB) | HTML iconHTML

    We introduce a new and natural algebraic proof system, which has tight connections to (algebraic) circuit complexity. In particular, we show that any super-polynomial lower bound on any Boolean tautology in our proof system implies that the permanent does not have polynomial-size algebraic circuits (VNP≠VP). As a corollary, super-polynomial lower bounds on the number of lines in Polynomial ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complexity Classification of Local Hamiltonian Problems

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

    The calculation of ground-state energies of physical systems can be formalised as the k-local Hamiltonian problem, which is the natural quantum analogue of classical constraint satisfaction problems. One way of making the problem more physically meaningful is to restrict the Hamiltonian in question by picking its terms from a fixed set S. Examples of such special cases are the Heisenberg and Ising... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts

    Publication Year: 2014, Page(s):130 - 139
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB) | HTML iconHTML

    For a class C of graphs, #Sub(C) is the counting problem that, given a graph H from C and an arbitrary graph G, asks for the number of subgraphs of G isomorphic to H. It is known that if C has bounded vertex-cover number (equivalently, the size of the maximum matching in C is bounded), then #Sub(C) is polynomial-time solvable. We complement this result with a corresponding lower bound: if C is any... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructive Discrepancy Minimization for Convex Sets

    Publication Year: 2014, Page(s):140 - 145
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (309 KB) | HTML iconHTML

    A classical theorem of Spencer shows that any set system with n sets and n elements admits a coloring of discrepancy O(√(n)). Recent exciting work of Bansal, Lovett and Meka shows that such colorings can be found in polynomial time. In fact, the Lovett-Meka algorithm finds a half integral point in any "large enough" polytope. However, their algorithm crucially relies on the facet structure ... View full abstract»

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