Proceedings of IEEE 36th Annual Foundations of Computer Science

23-25 Oct. 1995

Filter Results

Displaying Results 1 - 25 of 74
  • Lower bounds for monotone span programs

    Publication Year: 1995, Page(s):674 - 681
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (796 KB)

    Span programs provide a linear algebraic model of computation. Lower Bounds for span programs imply lower bounds for formula size, symmetric branching programs and for contact schemes. Monotone span programs correspond also to linear secret-sharing schemes. We present a technique for proving lower bounds for monotone span programs, and prove a lower bound of Ω(m/sup 2.5/) for the 6-clique ... View full abstract»

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

    Publication Year: 1995
    Request permission for commercial reuse | |PDF file iconPDF (103 KB)
    Freely Available from IEEE
  • Sparse P-hard sets yield space-efficient algorithms

    Publication Year: 1995, Page(s):354 - 361
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (500 KB)

    J. Hartmanis (1978) conjectured that there exist no sparse complete sets for P under logspace many-one reductions. In this paper, in support of the conjecture, it is shown that if P has sparse hard sets under logspace many-one reductions, then P⊆DSPACE[log2n]. The result follows from a more general statement: if P has 2polylog sparse hard sets under poly-logarithmic spac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hard-core distributions for somewhat hard problems

    Publication Year: 1995, Page(s):538 - 545
    Cited by:  Papers (46)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (632 KB)

    Consider a decision problem that cannot be 1-δ approximated by circuits of a given size in the sense that any such circuit fails to give the correct answer on at least a δ fraction of instances. We show that for any such problem there is a specific “hard core” set of inputs which is at least a δ fraction of all inputs and on which no circuit of a slightly smaller size... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • RSPACE(S)⊆DSPACE(S3/2)

    Publication Year: 1995, Page(s):344 - 353
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (848 KB)

    We prove that any language that can be recognized by a randomized algorithm (with possibly two-sided error) that runs in space S and expected time 20(s) can be recognized by a deterministic algorithm running in space S3/2. This improves over the best previously known result that such algorithms have deterministic space S 2 simulations which, for one-sided error alg... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On one-dimensional quantum cellular automata

    Publication Year: 1995, Page(s):528 - 537
    Cited by:  Papers (17)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (716 KB)

    Since Richard Feynman introduced the notion of quantum computation in 1982, various models of “quantum computers” have been proposed (R. Feynman, 1992). These models include quantum Turing machines and quantum circuits. We define another quantum computational model, one dimensional quantum cellular automata, and demonstrate that any quantum Turing machine can be efficiently simulated b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient algorithms for learning to play repeated games against computationally bounded adversaries

    Publication Year: 1995, Page(s):332 - 341
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1100 KB)

    We examine the problem of learning to play various games optimally against resource-bounded adversaries, with an explicit emphasis on the computational efficiency of the learning algorithm. We are especially interested in providing efficient algorithms for games other than penny-matching (in which payoff is received for matching the adversary's action in the current round), and for adversaries oth... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using autoreducibility to separate complexity classes

    Publication Year: 1995, Page(s):520 - 527
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (612 KB)

    A language is autoreducible if it can be reduced to itself by a Turing machine that does not ask its own input to the oracle. We use autoreducibility to separate exponential space from doubly exponential space by showing that all Turing complete sets for exponential space are autoreducible but there exists some Turing complete set for doubly exponential space that is not. We immediately also get a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Gambling in a rigged casino: The adversarial multi-armed bandit problem

    Publication Year: 1995, Page(s):322 - 331
    Cited by:  Papers (84)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (836 KB)

    In the multi-armed bandit problem, a gambler must decide which arm of K non-identical slot machines to play in a sequence of trials so as to maximize his reward. This classical problem has received much attention because of the simple model it provides of the trade-off between exploration (trying out each arm to find the best one) and exploitation (playing the arm believed to give the best payoff)... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An optimal algorithm for Monte Carlo estimation

    Publication Year: 1995, Page(s):142 - 149
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (592 KB)

    A typical approach to estimate an unknown quantity μ is to design an experiment that produces a random variable Z distributed in [O,1] with E[Z]=μ, run this experiment independently a number of times and use the average of the outcomes as the estimate. In this paper, we consider the case when no a priori information about Z is known except that is distributed in [0,1]. We describe an approxi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Linear time erasure codes with nearly optimal recovery

    Publication Year: 1995, Page(s):512 - 519
    Cited by:  Papers (16)  |  Patents (43)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (828 KB)

    An (n,c,l,r) erasure code consists of an encoding algorithm and a decoding algorithm with the following properties. The encoding algorithm produces a set of l-bit packets of total length cn from an n-bit message. The decoding algorithm is able to recover the message from any set of packets whose total length is r, i.e., from any set of r/l packets. We describe erasure codes where both the encoding... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Perspectives on database theory

    Publication Year: 1995, Page(s):224 - 246
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (2152 KB)

    Database management systems address the need to store, retrieve, and manipulate large amounts of data in an organized fashion. The database held has grown tremendously in the last 25 years. It is reported that the database industry generated $7 billion in revenue in 1994 and is growing at a rate of 35% per year. Industrial and academic research have been instrumental to this growth. Theory has pla... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tracking the best disjunction

    Publication Year: 1995, Page(s):312 - 321
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (732 KB)

    N. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of the n variables and does multiplicative updates to its weights. We develop a randomized version of Winnow and prove bounds for an adaptation of the algorithm for the case when the disjunction may change over time. In this case a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximating the volume of definable sets

    Publication Year: 1995, Page(s):134 - 141
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (640 KB)

    The first part of this paper deals with finite-precision arithmetic. We give an upper bound on the precision that should be used in a Monte-Carlo integration method. Such bounds have been known only for convex sets; our bound applies to almost any “reasonable” set. In the second part of the paper, we show how to construct in polynomial time first-order formulas that approximately defin... View full abstract»

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

    Publication Year: 1995, Page(s):502 - 511
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (768 KB)

    A sender communicates with a receiver who wishes to reliably evaluate a function of their combined data. We show that if only the sender can transmit, the number of bits required is a conditional entropy of a naturally defined graph. We also determine the number of bits needed when the communicators exchange two messages View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Speed is as powerful as clairvoyance [scheduling problems]

    Publication Year: 1995, Page(s):214 - 221
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (668 KB)

    We consider several well known nonclairvoyant scheduling problems, including the problem of minimizing the average response time, and best-effort firm real-time scheduling. It is known that there are no deterministic online algorithms for these problems with bounded (or even polylogarithmic in the number of jobs) competitive ratios. We show that moderately increasing the speed of the processor use... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simple learning algorithms for decision trees and multivariate polynomials

    Publication Year: 1995, Page(s):304 - 311
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (572 KB)

    In this paper we develop a new approach for learning decision trees and multivariate polynomials via interpolation of multivariate polynomials. This new approach yields simple learning algorithms for multivariate polynomials and decision trees over finite fields under any constant bounded product distribution. The output hypothesis is a (single) multivariate polynomial that is an ε-approximat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient parallel solution of sparse eigenvalue and eigenvector problems

    Publication Year: 1995, Page(s):123 - 132
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1100 KB)

    This paper gives a new algorithm for computing the characteristic polynomial of a symmetric sparse matrix. We derive an interesting algebraic version of nested dissection, which constructs a sparse factorization the matrix A-λ where A is the input matrix. While nested dissection is commonly used to minimize the fill-in in the solution of sparse linear systems, our innovation is to use the s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Controllability, recognizability, and complexity issues in robot motion planning

    Publication Year: 1995, Page(s):484 - 500
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1536 KB)

    Path planning has been widely studied by computer scientists. However, it is a very simplified version of the motion planning problems occurring in robotics. This paper examines extensions yielding two important issues: controllability and recognizability. The controllability issue arises when the number of controls is smaller than the number of independent parameters defining the robot's configur... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application-controlled paging for a shared cache

    Publication Year: 1995, Page(s):204 - 213
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (860 KB)

    We consider a cache shared by several concurrently running application processes and propose a provably efficient application-controlled global strategy for the shared cache. Using future information implicitly in the form of good decisions by application processes, we are able to break through the Hk lower bound on competitive ratio proved for classical paging for a k-sized cache in [F... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning polynomials with queries: The highly noisy case

    Publication Year: 1995, Page(s):294 - 303
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (884 KB)

    Given a function f mappping n-variate inputs from a finite field F into F, we consider the task of reconstructing a list of all n-variate degree d polynomials which agree with f on a tiny but non-negligible fraction, δ, of the input space. We give a randomized algorithm for solving this task which accesses f as a black box and runs in time polynomial in 1/δ, n and exponential in d, pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tight bounds for a distributed selection game with applications to fixed-connection machines

    Publication Year: 1995, Page(s):114 - 122
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (796 KB)

    We define a distributed selection game that generalizes a selection problem considered by S.R. Kosaraju (1989). We offer a tight analysis of our distributed selection game, and show that the lower bound for this abstract communication game directly implies near-tight lower bounds for certain selection problems on fixed-connection machines. For example, we prove that any deterministic comparison-ba... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improved algorithms and analysis for secretary problems and generalizations

    Publication Year: 1995, Page(s):473 - 482
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (840 KB)

    In the classical secretary problem, n objects from an ordered set arrive in random order, and one has to accept k of them so that the final decision about each object is made only on the basis of its rank relative to the ones already seen. Variants of the problem depend on the goal: either maximize the probability of accepting the best k objects, or minimize the expectation of the sum of the ranks... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A unified analysis of paging and caching

    Publication Year: 1995, Page(s):194 - 203
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (868 KB)

    Paging (caching) is the problem of managing a two-level memory hierarchy in order to minimise the time required to process a sequence of memory accesses. In order to measure this quantity, we define the system parameter miss penalty to represent the extra time required to access slow memory. In the context of paging, miss penalty is large, so most previous studies of on-line paging have implicitly... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finding points on curves over finite fields

    Publication Year: 1995, Page(s):284 - 292
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (584 KB)

    We solve two computational problems concerning plane algebraic curves over finite fields: generating an (approximately) uniform random point, and finding all points deterministically in amortized polynomial time (over a prime field, for non-exceptional curves) View full abstract»

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