45th Annual IEEE Symposium on Foundations of Computer Science

17-19 Oct. 2004

Filter Results

Displaying Results 1 - 25 of 72
  • 45th Annual IEEE Symposium on Foundations of Computer Science - Cover

    Publication Year: 2004, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (79 KB)
    Freely Available from IEEE
  • 45th Annual IEEE Symposium on Foundations of Computer Science - Title Page

    Publication Year: 2004, Page(s):i - iii
    Request permission for commercial reuse | PDF file iconPDF (53 KB)
    Freely Available from IEEE
  • 45th Annual IEEE Symposium on Foundations of Computer Science - Copyright Page

    Publication Year: 2004, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (41 KB)
    Freely Available from IEEE
  • Proceedings. 45th Annual IEEE Symposium on Foundations of Computer Science

    Publication Year: 2004
    Request permission for commercial reuse | PDF file iconPDF (60 KB)
    Freely Available from IEEE
  • Foreword

    Publication Year: 2004, Page(s): x
    Request permission for commercial reuse | PDF file iconPDF (26 KB) | HTML iconHTML
    Freely Available from IEEE
  • Conference Organization and Program Committee

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

    Publication Year: 2004, Page(s):xii - xiv
    Request permission for commercial reuse | PDF file iconPDF (23 KB)
    Freely Available from IEEE
  • Quantum weak coin-flipping with bias of 0.192

    Publication Year: 2004, Page(s):2 - 11
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (208 KB) | HTML iconHTML

    We present a family of protocols for flipping a coin over a telephone in a quantum mechanical setting. The family contains protocols with n + 2 messages for all n > 1, and asymptotically achieves a bias of 0.192. The case n = 2 is equivalent to the protocol of Spekkens and Rudolph with bias 0.207, which was the best known protocol. The case n = 3 achieves a bias of 0.199, and n = 8 achieves a bias... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantum and classical strong direct product theorems and optimal time-space tradeoffs

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

    A strong direct product theorem says that if we want to compute k independent instances of a function, using less than k times the resources needed for one instance, then our overall success probability is exponentially small in k. We establish such theorems for the classical as well as quantum query complexity of the OR function. This implies slightly weaker direct product results for all total f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantum walk algorithm for element distinctness

    Publication Year: 2004, Page(s):22 - 31
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB) | HTML iconHTML

    We use quantum walks to construct a new quantum algorithm for element distinctness and its generalization. For element distinctness (the problem of finding two equal items among N given items), we get an O(N23/) query quantum algorithm. This improves the previous O(N34/) quantum algorithm of Buhrman et al. and matches the lower bound by Shi. We also give an O(Nk(k+... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantum speed-up of Markov chain based algorithms

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

    We develop a generic method for quantizing classical algorithms based on random walks. We show that under certain conditions, the quantum version gives rise to a quadratic speed-up. This is the case, in particular, when the Markov chain is ergodic and its transition matrix is symmetric. This generalizes the celebrated result of L. K. Grover (1996)and a number of more recent results, including the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adiabatic quantum computation is equivalent to standard quantum computation

    Publication Year: 2004, Page(s):42 - 51
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB) | HTML iconHTML

    The model of adiabatic quantum computation has recently attracted attention in the physics and computer science communities, but its exact computational power has been unknown. We settle this question and describe an efficient adiabatic simulation of any given quantum algorithm. This implies that the adiabatic computation model and the standard quantum circuit model are polynomially equivalent. We... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximizing quadratic programs: extending Grothendieck's inequality

    Publication Year: 2004, Page(s):54 - 60
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB) | HTML iconHTML

    This paper considers the following type of quadratic programming problem. Given an arbitrary matrix A, whose diagonal elements are zero, find x ∈ {-1, 1}n such that xTAx is maximized. Our approximation algorithm for this problem uses the canonical semidefinite relaxation and returns a solution whose ratio to the optimum is in Ω(1/ logn). This quadratic programming ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An approximate max-Steiner-tree-packing min-Steiner-cut theorem

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

    Given an undirected multigraph G and a subset of vertices S ⊆ V(G), the Steiner tree packing problem is to find a largest collection of edge-disjoint trees that each connects S. This problem and its generalizations have attracted considerable attention from researchers in different areas because of their wide applicability. This problem was shown to be APX-hard (no polynomial time approximati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Edge-disjoint paths in planar graphs

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

    We study the maximum edge-disjoint paths problem (MEDP). We are given a graph G = (V, E) and a set T = {s1t1, s2t2,..., sktk} of pairs of vertices: the objective is to find the maximum number of pairs in T that can be connected via edge-disjoint paths. Our main result is a poly-logarithmic approximation for MEDP on undirected planar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Machine minimization for scheduling jobs with interval constraints

    Publication Year: 2004, Page(s):81 - 90
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (176 KB) | HTML iconHTML

    The problem of scheduling jobs with interval constraints is a well-studied classical scheduling problem. The input to the problem is a collection of n jobs where each job has a set of intervals on which it can be scheduled. The goal is to minimize the total number of machines needed to schedule all jobs subject to these interval constraints. In the continuous version, the allowed intervals associa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Random edge can be exponential on abstract cubes

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

    We prove that random edge, the simplex algorithm that always chooses a random improving edge to proceed on, can take a mildly exponential number of steps in the model of abstract objective functions (introduced by K. W. Hoke (1998) and by G. Kalai (1988) under different names). We define an abstract objective function on the n-dimensional cube for which the algorithm, started at a random vertex, n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the integrality ratio for asymmetric TSP

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

    The traveling salesman problem comes in two variants. The symmetric version (STSP) assumes that the cost cij of going to city i to city j is equal to cji, while the more general asymmetric version (ATSP) does not make this assumption. In both cases, it is usually assumed that we are in the metric case, i.e., the costs satisfy the triangle inequality: cij + cjk... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The hardness of metric labeling

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

    The metric labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set of labels and a weighted graph. Additionally, a metric distance function on the labels is defined, and for each label and each vertex, an assignment cost is given. The goal is to find a minimum-cost assignment of the vertices to the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hardness of buy-at-bulk network design

    Publication Year: 2004, Page(s):115 - 124
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB) | HTML iconHTML

    We consider the buy-at-bulk network design problem in which we wish to design a network for carrying multicommodity demands from a set of source nodes to a set of destination nodes. The key feature of the problem is that the cost of capacity on each edge is concave and hence exhibits economies of scale. If the cost of capacity per unit length can be different on different edges then, we say that t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hardness of approximating the shortest vector problem in lattices

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

    Let p > 1 be any fixed real. We show that assuming NP ⊄‾ RP, it is hard to approximate the shortest vector problem (SVP) in lp norm within an arbitrarily large constant factor. Under the stronger assumption NP ⊄‾ RTIME(2poly(log n)), we show that t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ruling out PTAS for graph min-bisection, densest subgraph and bipartite clique

    Publication Year: 2004, Page(s):136 - 145
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (328 KB) | HTML iconHTML

    Assuming that NP ⊄‾∩ε > 0 BPTIME(2nε), we show that graph min-bisection, densest subgraph and bipartite clique have no PTAS. We give a reduction from the minimum distance of code problem (MDC). Starting with an instance of MDC, we build a quasi-random PCP that suffices to prove the desir... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal inapproximability results for MAX-CUT and other 2-variable CSPs?

    Publication Year: 2004, Page(s):146 - 154
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB) | HTML iconHTML

    In this paper, we give evidence suggesting that MAX-CUT is NP-hard to approximate to within a factor of αcw+ ε, for all ε > 0, where αcw denotes the approximation ratio achieved by the Goemans-Williamson algorithm (1995). αcw ≈ .878567. This result is conditional, relying on two conjectures: a) the unique games conjecture of Khot; ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Assignment testers: towards a combinatorial proof of the PCP-theorem

    Publication Year: 2004, Page(s):155 - 164
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB) | HTML iconHTML

    In this work, we look back into the proof of the PCP theorem, with the goal of finding new proofs that are "more combinatorial" and arguably simpler. For that, we introduce the notion of an assignment tester, which is a strengthening of the standard PCP verifier, in the following sense. Given a statement and an alleged proof for it, while the PCP verifier checks correctness of the statement, the a... View full abstract»

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

    Publication Year: 2004, Page(s):166 - 175
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (400 KB) | HTML iconHTML

    We study the parallel time-complexity of basic cryptographic primitives such as one-way functions (OWFs) and pseudorandom generators (PRGs). Specifically, we study the possibility of computing instances of these primitives by NC0 circuits, in which each output bit depends on a constant number of input bits. Despite previous efforts in this direction, there has been no significant theore... View full abstract»

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