Proceedings of 37th Conference on Foundations of Computer Science

14-16 Oct. 1996

Filter Results

Displaying Results 1 - 25 of 67
  • Proceedings of 37th Conference on Foundations of Computer Science

    Publication Year: 1996
    Request permission for commercial reuse | |PDF file iconPDF (355 KB)
    Freely Available from IEEE
  • Approximate strip packing

    Publication Year: 1996, Page(s):31 - 36
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (564 KB)

    We present an approximation scheme for strip-packing, or packing rectangles into a rectangle of fixed width and minimum height, a classical NP-hard cutting-stock problem. The algorithm finds a packing of n rectangles whose total height is within a factor of (1+/spl epsiv/) of optimal, and has running time polynomial both in n and in 1//spl epsiv/. It is based on a reduction to fractional bin-packi... View full abstract»

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

    Publication Year: 1996
    Request permission for commercial reuse | |PDF file iconPDF (99 KB)
    Freely Available from IEEE
  • An 8-approximation algorithm for the subset feedback vertex set problem

    Publication Year: 1996, Page(s):310 - 319
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (876 KB)

    We present an 8-approximation algorithm for the problem of finding a minimum weight subset feedback vertex set. The input in this problem consists of an undirected graph G=(V,E) with vertex weights w(v) and a subset of vertices S called special vertices. A cycle is called interesting if it contains at least one special vertex. A subset of vertices is called a subset feedback vertex set with respec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A 3-approximation for the minimum tree spanning k vertices

    Publication Year: 1996, Page(s):302 - 309
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (644 KB)

    In this paper we give a 3-approximation algorithm for the problem of finding a minimum tree spanning any k-vertices in a graph. Our algorithm extends to a 3-approximation algorithm for the minimum tour that visits any k-vertices View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximating minimum-size k-connected spanning subgraphs via matching

    Publication Year: 1996, Page(s):292 - 301
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (892 KB)

    An efficient heuristic is presented for the problem of finding a minimum-size k-connected spanning subgraph of a given (undirected or directed) graph G=(V,E). There are four versions of the problem, depending on whether G is undirected or directed, and whether the spanning subgraph is required to be k-node connected (k-NCSS) or k-edge connected (k-ECSS). The approximation guarantees are as follows... View full abstract»

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

    Publication Year: 1996, Page(s):244 - 253
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (772 KB)

    As increasingly large volumes of sophisticated options are traded in world financial markets, determining a “fair” price for these options has become an important and difficult computational problem. Many valuation codes use the binomial pricing model, in which the stock price is driven by a random walk. In this model, the value of an n-period option on a stock is the expected time-dis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Deterministic routing with bounded buffers: turning offline into online protocols

    Publication Year: 1996, Page(s):370 - 379
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (868 KB)

    In this paper we present a deterministic protocol for routing arbitrary permutations in arbitrary networks. The protocol is analyzed in terms of the size of the network and the routing number of the network. Given a network H of size n, the routing number of H is defined as the maximum over all permutations π on [n] of the minimal number of steps to route π offline in H. We can show that for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Gadgets, approximation, and linear programming

    Publication Year: 1996, Page(s):617 - 626
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (764 KB)

    The authors present a linear-programming based method for finding “gadgets”, i.e., combinatorial structures reducing constraints of one optimization problem to constraints of another. A key step in this method is a simple observation which limits the search space to a finite one. Using this new method they present a number of new, computer-constructed gadgets for several different redu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computationally hard algebraic problems

    Publication Year: 1996, Page(s):284 - 289
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (372 KB)

    In this paper we present a simple geometric-like series of elements in a finite field Fq, and show that computing its sum is NP-hard. This problem is then reduced to the problem of counting mod p the number of zeroes in a linear recurrence sequence with elements in a finite Fp, where p is a small prime. Hence the latter problem is also NP-hard. In the lecture we shall also su... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Solving systems of polynomial congruences modulo a large prime

    Publication Year: 1996, Page(s):115 - 124
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (868 KB)

    We consider the following polynomial congruences problem: given a prime p, and a set of polynomials f1,...,fm∈ Fp[x1,...,xn] of total degree at most d, solve the system f1=...=fm=0 for solution(s) in Fpn. We give a randomized algorithm for the decision version of this problem. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient information gathering on the Internet

    Publication Year: 1996, Page(s):234 - 243
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (904 KB)

    The Internet offers unprecedented access to information. At present most of this information is free, but information providers ore likely to start charging for their services in the near future. With that in mind this paper introduces the following information access problem: given a collection of n information sources, each of which has a known time delay, dollar cost and probability of providin... View full abstract»

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

    Publication Year: 1996, Page(s):359 - 368
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (668 KB)

    We present a polynomial time algorithm to learn (in Valiant's PAC model) an arbitrarily oriented cube in n-space, given uniformly distributed sample points from it. In fact, we solve the more general problem of learning, in polynomial time, a linear (affine) transformation of a product distribution View full abstract»

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

    Publication Year: 1996, Page(s):612 - 616
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (384 KB)

    The authors provide an O˜(n2) time randomized algorithm to check whether a given operation f:S×S→S is associative (letting n=|S|). They prove this performance is optimal (up to polylogarithmic factors) even in case the operation is “cancellative”. No sub-n3 algorithm was previously known for this task. More generally they give an O(nc )... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simplified and improved resolution lower bounds

    Publication Year: 1996, Page(s):274 - 282
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (684 KB)

    We give simple new lower bounds on the lengths of resolution proofs for the pigeonhole principle and for randomly generated formulas. For random formulas, our bounds significantly extend the range of formula sizes for which non-trivial lower bounds are known. For example, we show that with probability approaching 1, any resolution refutation of a randomly chosen 3-CNF formula with at most n6/... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computing permanents over fields of characteristic 3: where and why it becomes difficult

    Publication Year: 1996, Page(s):108 - 114
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (384 KB)

    In this paper we consider the complexity of computing permanents over fields of characteristic 3. We present a polynomial time algorithm for computing per(A) for a matrix A such that the rank rg(AAT-I)⩽1. On the other hand, we show that existence of a polynomial-time algorithm for computing per(A) for a matrix A such that rg(AAT-I)⩾2 implies NP=R. As a byproduct we ob... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal dynamic interval management in external memory

    Publication Year: 1996, Page(s):560 - 569
    Cited by:  Papers (16)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (920 KB)

    The authors present a space- and I/O-optimal external-memory data structure for answering stabbing queries on a set of dynamically maintained intervals. The data structure settles an open problem in databases and I/O algorithms by providing the first optimal external-memory solution to the dynamic interval management problem, which is a special case of 2-dimensional range searching and a central p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tree data structures for N-body simulation

    Publication Year: 1996, Page(s):224 - 233
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (796 KB)

    In this paper, we study data structures for use in N-body simulation. We concentrate on the spatial decomposition tree used in particle-cluster force evaluation algorithms such as the Barnes-Hut algorithm. We prove that a k-d tree is asymptotically inferior to a spatially balanced tree. We show that the worst case complexity of the force evaluation algorithm using a k-d tree is Θ(nlog3<... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The optimal path-matching problem

    Publication Year: 1996, Page(s):78 - 85
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (688 KB)

    We describe a common generalization of the weighted matching problem and the weighted matroid intersection problem. In this context we present results implying the polynomial-time solvability of the two problems. We also use our results to give the first strongly polynomial separation algorithm for the convex hull of matchable sets of a graph, and the first polynomial-time algorithm to compute the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the applications of multiplicity automata in learning

    Publication Year: 1996, Page(s):349 - 358
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (824 KB)

    The learnability of multiplicity automata has attracted a lot of attention, mainly because of its implications on the learnability of several classes of DNF formulae. The authors further study the learnability of multiplicity automata. The starting point is a known theorem from automata theory relating the number of states in a minimal multiplicity automaton for a function f to the rank of a certa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient self-testing/self-correction of linear recurrences

    Publication Year: 1996, Page(s):602 - 611
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (900 KB)

    The authors consider the problem of designing self-testers/self-correctors for functions defined by linear recurrences. They present the first complete package of efficient and simple self-testers, self-correctors, and result-checkers for such functions. The results are proved by demonstrating an efficient reduction from this problem to the problem of testing linear functions over certain matrix g... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universal data compression and portfolio selection

    Publication Year: 1996, Page(s):534 - 538
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (360 KB)

    The authors consider universal data compression, universal portfolio selection (online portfolio algorithms) and the relationship of both to information theory. Apparently the fundamental minimax redundancy game in data compression and the minimax regret game for the growth rate of wealth in investment have the same answer. There is also a duality between entropy rate and the growth rate of wealth View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Equivalence in finite-variable logics is complete for polynomial time

    Publication Year: 1996, Page(s):264 - 273
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (932 KB)

    How difficult is it to decide whether two finite structures can be distinguished in a given logic? For first order logic, this question is equivalent to the graph isomorphism problem with its well-known complexity theoretic difficulties. Somewhat surprisingly, the situation is much clearer when considering the fragments Lk of first-order logic whose formulae contain at most k (free or b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A general approach to dynamic packet routing with bounded buffers

    Publication Year: 1996, Page(s):390 - 399
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (832 KB)

    We prove a sufficient condition for the stability of dynamic packet routing algorithms. Our approach reduces the problem of steady state analysis to the easier and better understood question of static routing. We show that certain high probability and worst case bounds on the quasistatic (finite past) performance of a routing algorithm imply bounds on the performance of the dynamic version of that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Spectral partitioning works: planar graphs and finite element meshes

    Publication Year: 1996, Page(s):96 - 105
    Cited by:  Papers (30)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (784 KB)

    Spectral partitioning methods use the Fiedler vector-the eigenvector of the second-smallest eigenvalue of the Laplacian matrix-to find a small separator of a graph. These methods are important components of many scientific numerical algorithms and have been demonstrated by experiment to work extremely well. In this paper, we show that spectral partitioning methods work well on bounded-degree plana... View full abstract»

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