[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science

1-4 Oct. 1991

Filter Results

Displaying Results 1 - 25 of 86
  • Proceedings 32nd Annual Symposium on Foundations of Computer Science (Cat. No.91CH3062-7)

    Publication Year: 1991
    Request permission for commercial reuse | PDF file iconPDF (17 KB)
    Freely Available from IEEE
  • Languages that are easier than their proofs

    Publication Year: 1991, Page(s):19 - 28
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (800 KB)

    Languages in NP are presented for which it is harder to prove membership interactively than it is to decide this membership. Similarly, languages where checking is harder than computing membership are presented. Under assumptions about triple-exponential time, incoherent sets in NP are constructed. Without any assumptions, incoherent sets are constructed in DSPACE (n to the log n View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fully parallelized multi prover protocols for NEXP-time

    Publication Year: 1991, Page(s):13 - 18
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (488 KB)

    A major open problem in the theory of multiprover protocols is to characterize the languages which can be accepted by fully parallelized protocols which achieve an exponentially low probability of cheating in a single round. The problem was motivated by the observation that the probability of cheating the n parallel executions of a multiprover protocol can be exponentially higher than the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximating clique is almost NP-complete

    Publication Year: 1991, Page(s):2 - 12
    Cited by:  Papers (79)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 KB)

    The computational complexity of approximating ω(G), the size of the largest clique in a graph G, within a given factor is considered. It is shown that if certain approximation procedures exist, then EXPTIME=NEXPTIME and NP=P View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Search problems in the decision tree model

    Publication Year: 1991, Page(s):576 - 585
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    The relative power of determinism, randomness, and nondeterminism for search problems in the Boolean decision tree model is studied. It is shown that the CNF search problem is complete for all the variants of decision trees. It is then shown that the gaps between the nondeterministic, the randomized, and the deterministic complexities can be arbitrarily large for search problems. The special case ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-tolerant computation in the full information model

    Publication Year: 1991, Page(s):447 - 457
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (872 KB)

    Efficient two-party protocols for fault-tolerant computation of any two-argument function are presented. It is proved that the influence of a dishonest player in these protocols is the minimum one possible (up to polylogarithmic factors). Also presented are efficient m-party fault-tolerant protocols for sampling a general distribution (m⩾2). Efficient m-party protoco... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A quadratic time algorithm for the minmax length triangulation

    Publication Year: 1991, Page(s):414 - 423
    Cited by:  Papers (5)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (920 KB)

    It is shown that a triangulation of a set of n points in the plane that minimizes the maximum edge length can be computed in time O(n2). The algorithm is reasonably easy to implement and is based on the theorem that there is a triangulation with minmax edge length that contains the relative neighborhood graph of the points as a subgraph. With minor modificatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Finding the hidden path: time bounds for all-pairs shortest paths

    Publication Year: 1991, Page(s):560 - 568
    Cited by:  Papers (8)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (676 KB)

    The all-pairs shortest paths problem in weighted graphs is investigated. An algorithm called the hidden paths algorithm, which finds these paths in time O(m*+n n2 log n), where m* is the number of edges participating in shortest paths, is presented. It is argued that m* is likely to be small in practice, since m*=O(n log n) with high probability for many probability di... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliable computation with noisy circuits and decision trees-a general n log n lower bound

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

    Boolean circuits in which gates independently make errors with probability (at most) ε are considered. It is shown that the critical number crit(f) of a function f yields lower bound Ω(crit(f) log crit (f)) for the noisy circuit size. The lower bound is proved for an even stronger computational model, static Boolean decision trees with erroneous answe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotically optimal PRAM emulation on faulty hypercubes

    Publication Year: 1991, Page(s):440 - 446
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (588 KB)

    A scheme for emulating the parallel random access machine (PRAM) on a faulty hypercube is presented. All components of the hypercube, including the memory modules, are assumed to be subject to failure. The faults may occur at any time during the emulation and the system readjusts dynamically. The scheme, which rests on L.G. Valiant's BSP model (1990), is the first to achieve optimal and work-prese... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic scheduling on parallel machines

    Publication Year: 1991, Page(s):111 - 120
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (780 KB)

    The problem of online job scheduling on various parallel architectures is studied. An O((log log n)1/2 )-competitive algorithm for online dynamic scheduling on an n ×n mesh is given. It is proved that this algorithm is optimal up to a constant factor. The algorithm is not greedy, and the lower bound proof shows that no greedy-like algorithm can ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A general approach to removing degeneracies

    Publication Year: 1991, Page(s):405 - 413
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (732 KB)

    Algorithms modeled as algebraic branching programs, with inputs from an infinite ordered field, are studied. Direct perturbations on the input, so that an algorithm designed under the assumption of nondegeneracy can be applied to all inputs, are described. A deterministic method for algorithms with determinant tests and a randomized one for arbitrary test expressions are defined. They both incur e... View full abstract»

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

    Publication Year: 1991, Page(s):59 - 68
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (824 KB)

    Several alternative ways of defining knowledge complexity are presented, and the relationships between them are explored. The discussion covers inclusion results, separation results, properties of knowledge complexity of languages in the Hint sense, and the knowledge complexity of constant round AM proofs View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self-stabilization by local checking and correction

    Publication Year: 1991, Page(s):268 - 277
    Cited by:  Papers (58)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (816 KB)

    The first self-stabilizing end-to-end communication protocol and the most efficient known self-stabilizing network reset protocol are introduced. A simple method of local checking and correction, by which distributed protocols can be made self-stabilizing without the use of unbounded counters, is used. The self-stabilization model distinguishes between catastrophic faults that abstract arbitrary c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A linear time algorithm for triconnectivity augmentation

    Publication Year: 1991, Page(s):548 - 559
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1000 KB)

    The problem of finding the smallest set of edges whose addition triconnects an undirected graph is considered. This is a fundamental graph-theoretic problem that has applications in designing reliable networks and fault-tolerant computing. A linear time sequential algorithm is given for the problem. This is a substantial improvement over the best previous algorithm for this problem, which runs in ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Applications of a poset representation to edge connectivity and graph rigidity

    Publication Year: 1991, Page(s):812 - 821
    Cited by:  Papers (20)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (876 KB)

    A poset representation for a family of sets defined by a labeling algorithm is investigated. Poset representations are given for the family of minimum cuts of a graph, and it is shown how to compute them quickly. The representations are the starting point for algorithms that increase the edge connectivity of a graph, from λ to a given target τ=λ+δ, adding the fewest edges p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lower bounds for the complexity of reliable Boolean circuits with noisy gates

    Publication Year: 1991, Page(s):594 - 601
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (472 KB)

    It is proved that the reliable computation of any Boolean function with, sensitivity s requires Ω(s log s) gates if the gates of the circuit fail independently with a fixed positive probability. The Ω(s log s) bound holds even if s is the block sensitivity instead of the sensitivity of the Boolean function. Some open problems are me... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient algorithms for dynamic allocation of distributed memory

    Publication Year: 1991, Page(s):470 - 479
    Cited by:  Papers (1)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    The problem of dynamically allocating and deallocating local memory resources among multiple users in a parallel or distributed system is considered. The goal is to devise an online allocation algorithm that minimizes both the fraction of unused space due to fragmentation of the memory and the slowdown needed by the system to service user requests. The problem is solved in near-optimal fashion by ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On better heuristic for Euclidean Steiner minimum trees

    Publication Year: 1991, Page(s):431 - 439
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB)

    Finding a shortest network interconnecting a given set of points in the Euclidean plane (a Steiner minimum tree) is known to be NP-hard. It is shown that there exists a polynomial-time heuristic with a performance ratio bigger than √3/2 View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simulating BPP using a general weak random source

    Publication Year: 1991, Page(s):79 - 89
    Cited by:  Papers (30)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (932 KB)

    It is shown how to simulate BPP and approximation algorithms in polynomial time using the output from a δ-source. A δ-source is a weak random source that is asked only once for R bits, and must output an R-bit string according to some distribution that places probability no more than 2-δR on any particular string. Also given are two applications: one ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic three-dimensional linear programming

    Publication Year: 1991, Page(s):488 - 494
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB)

    Linear programming optimizations on the intersection of k polyhedra in R3, represented by their outer recursive decompositions, are performed in expected time O(k log k log n+√k log k log3 n). This result is used to derive efficient algorithms for dynamic linear programming problems ill which const... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On-line scheduling in the presence of overload

    Publication Year: 1991, Page(s):100 - 110
    Cited by:  Papers (45)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (864 KB)

    The preemptive scheduling of sporadic tasks on a uniprocessor is considered. A task may arrive at any time, and is characterized by a value that reflects its importance, an execution time that is the amount of processor time needed to completely execute the task, and a deadline by which the task is to complete execution. The goal is to maximize the sum of the values of the completed tasks. An onli... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A deterministic parallel algorithm for planar graphs isomorphism

    Publication Year: 1991, Page(s):723 - 732
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 KB)

    A deterministic parallel algorithm for determining whether two planar graphs are isomorphic is presented. The algorithm needs O(log n) separators that have to be computed one after the other. The running time is T=O(log3 n) time for finding separators, and the processors count is n1.5 log n/T. It is also ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interactive communication: balanced distributions, correlated files, and average-case complexity

    Publication Year: 1991, Page(s):228 - 238
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (876 KB)

    Suppose (X,Y) is a pair of random variables distributed over a support set S. Person Px knows X, person Py knows Y, and both know S. Using a predetermined protocol, they exchange binary messages in order for Py to learn X. Px may or may not learn Y... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Better expansion for Ramanujan graphs

    Publication Year: 1991, Page(s):398 - 404
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (460 KB)

    The expansion properties of regular graphs are investigated. The best previously known expansion of subsets of linear size of explicit k-regular graphs is k/4. This bound is achieved by nonbipartite Ramanujan graphs of degree k=p+1, which have the property that all but the largest eigenvalue have absolute value at most 2√p. The expansion coefficie... View full abstract»

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