By Topic

Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on

Date 3-5 Nov. 1993

Filter Results

Displaying Results 1 - 25 of 75
  • Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science

    Publication Year: 1993
    Request permission for commercial reuse | PDF file iconPDF (93 KB)
    Freely Available from IEEE
  • Highly efficient asynchronous execution of large-grained parallel programs

    Publication Year: 1993, Page(s):271 - 280
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (828 KB)

    An n-thread parallel program p is large-grained if in every parallel step the computations on each of the threads are complex procedures requiring numerous processor instructions. This practically relevant style of programs differs from PRAM programs in its large granularity and the possibility that within a parallel step the computations on different threads may considerably vary in size. Let M b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • What can we sort in o(nlog n) time?

    Publication Year: 1993, Page(s):538 - 546
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 KB)

    We define two conditions on a random access machine (RAM) with arithmetic and Boolean instructions and possible bounds on word and memory sizes. One condition asserts that we either restrict attention to short words or allow non-uniform programs. The second asserts that we either allow a large memory or a double-precision multiplication. Our main theorem shows that the RAM can sort in o(nlog n) ti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A quantum bit commitment scheme provably unbreakable by both parties

    Publication Year: 1993, Page(s):362 - 371
    Cited by:  Papers (18)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB)

    We describe a complete protocol for bit commitment based on the transmission of polarized photons. We show that under the laws of quantum physics, this protocol cannot be cheated by either party except with exponentially small probability (exponential in the running time needed to implement the honest protocol). A more thorough analysis is required to adjust all the constants used in this paper to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the “log rank”-conjecture in communication complexity

    Publication Year: 1993, Page(s):168 - 176
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (476 KB)

    We show the existence of a non-constant gap between the communication complexity of a function and the logarithm of the rank of its input matrix. We consider the following problem: each of two players gets a perfect matching between two n-element sets of vertices. Their goal is to decide whether or not the union of the two matchings forms a Hamiltonian cycle. We prove: (1) The rank of the input ma... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On representations by low-degree polynomials

    Publication Year: 1993, Page(s):130 - 138
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB)

    In the first part of the paper we show that a subset S of a boolean cube Bn embedded in the projective space Pn can be approximated by a subset of Bn defined by nonzeroes of a low-degree polynomial only if the values of the Hilbert function of S are sufficiently small relative to the size of S. The use of this property provides a simple and direct technique for pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • General bounds on statistical query learning and PAC learning with noise via hypothesis boosting

    Publication Year: 1993, Page(s):282 - 291
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (856 KB)

    We derive general bounds on the complexity of learning in the statistical query model and in the PAC model with classification noise. We do so by considering the problem of boosting the accuracy of weak learning algorithms which fall within the statistical query model. This new model was introduced by M. Kearns (1993) to provide a general framework for efficient PAC learning in the presence of cla... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A weak version of the Blum, Shub and Smale model

    Publication Year: 1993, Page(s):486 - 495
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    We propose a weak version of the Blum-Shub-Smale model (1989) of computation over the real numbers. In this weak model only a “moderate” usage of multiplications and divisions is allowed. The class of languages recognizable in polynomial time as shown to be the complexity class P/poly. This implies under a standard complexity-theoretic assumption that P≠NP in the weak model, and tha... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On bounded queries and approximation

    Publication Year: 1993, Page(s):547 - 556
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    This paper investigates the computational complexity of approximating NP-optimization problems using the number of queries to an NP oracle as a complexity measure. The results show a trade-off between the closeness of the approximation and the number of queries required. For an approximation factor k(n), loglogk(n) n queries to an NP oracle can be used to approximate the maximum clique ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions

    Publication Year: 1993, Page(s):248 - 258
    Cited by:  Papers (7)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (920 KB)

    All algorithms below are optimal alphabet-independent parallel CRCW PRAM algorithms. In one dimension: Given a pattern string of length m for the string-matching problem, we design an algorithm that computes a deterministic sample of a sufficiently long substring in constant time. This problem used to be a bottleneck in the pattern preprocessing for one- and two-dimensional pattern matching. The b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universal emulations with sublogarithmic slowdown

    Publication Year: 1993, Page(s):341 - 350
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    The existence of bounded degree networks which can emulate the computation of any bounded degree network of the same size with logarithmic slowdown is well-known. The butterfly is an example of such a universal network. Leiserson was the first to introduce the concept of an area-universal network: a network with VLSI layout area A which can emulate any network of the same size and layout area with... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs

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

    We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover problem and its generalizations. Our algorithms use randomization, and our randomized voting lemmas may be of independent interest. Fast parallel approximation algorithms were known before for set cover, though not for any of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Solving systems of set constraints with negated subset relationships

    Publication Year: 1993, Page(s):372 - 380
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    We present a decision procedure, based on tree automata techniques, for satisfiability of systems of set constraints including negated subset relationships. This result extends all previous works on set constraints solving and solves a problem which was left open by L. Bachmair et al. (1993). We prove in a constructive way that a non empty set of solutions always contains a regular solution, that ... View full abstract»

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

    Publication Year: 1993, Page(s):392 - 399
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    Discrepancy theory addresses the general issue of approximating one measure by another one. Originally an offshoot of diophantine approximation theory, the area has expanded into applied mathematics, and now, computer science. Besides providing the theoretical foundation for sampling, it holds some of the keys to understanding the computational power of randomization. A few applications of discrep... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The complexity of the theory of p-adic numbers

    Publication Year: 1993, Page(s):412 - 421
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (740 KB)

    This paper addresses the question of the complexity of the decision problem for the theory Th(Qp) of p-adic numbers. The best known lower bound for the theory is double exponential alternating time with a linear number of alternations. I have designed an algorithm that determines the truth value of sentences of the theory requiring double exponential space. My algorithm is based on tech... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Heat and Dump: competitive distributed paging

    Publication Year: 1993, Page(s):22 - 31
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (740 KB)

    This paper gives a randomized competitive distributed paging algorithm called Heat and Dump, The competitive ratio is logarithmic in the total storage capacity of the network, this is optimal to within a constant factor. This is in contrast to the linear optimal deterministic competitive ratio View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Las Vegas algorithms for matrix groups

    Publication Year: 1993, Page(s):427 - 436
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (836 KB)

    We consider algorithms in finite groups, given by a list of generators. We give polynomial time Las Vegas algorithms (randomized, with guaranteed correct output) for basic problems for finite matrix groups over the rationals (and over algebraic number fields): testing membership, determining the order, finding a presentation (generators and relations), and finding basic building blocks: center, co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The complexity and distribution of hard problems

    Publication Year: 1993, Page(s):177 - 185
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB)

    Measure-theoretic aspects of the ⩽mP-reducibility structure of exponential time complexity classes E=DTIME(2linear) and E2=DTIME(2 polynomial) are investigated. Particular attention is given to the complexity (measured by the size of complexity cores) and distribution (abundance in the sense of measure) of languages that are ⩽... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • NP trees and Carnap's modal logic

    Publication Year: 1993, Page(s):42 - 51
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    We consider problems and complexity classes definable by interdependent queries to an oracle in NP. How the queries depend on each other is specified by a directed graph G. We first study the class of problems where G is a general dag and show that this class coincides with Δ2P. We then consider the class where G is a tree. Our main result states that this class is iden... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixed

    Publication Year: 1993, Page(s):140 - 147
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB)

    We present a polynomial-time algorithm for determining whether a set of species, described by the characters they exhibit, has a perfect phylogeny, assuming the maximum number of possible states for a character is fixed. This solves a longstanding open problem. Our result should be contrasted with the proof by Steel and Bodlaender, Fellows, and Warnow that the perfect phylogeny problem is NP-compl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scale-sensitive dimensions, uniform convergence, and learnability

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

    Learnability in Valiant's PAC learning model has been shown to be strongly related to the existence of uniform laws of large numbers. These laws define a distribution-free convergence property of means to expectations uniformly over classes of random variables. Classes of real-valued functions enjoying such a property are also known as uniform Gliveako-Cantelli classes. In this paper we prove, thr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Almost tight upper bounds for lower envelopes in higher dimensions

    Publication Year: 1993, Page(s):498 - 507
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (816 KB)

    We show that the combinatorial complexity of the lower envelope of n surfaces or surface patches in d-space (d⩾3), all algebraic of constant maximum degree, and bounded by algebraic surfaces of constant maximum degree, is O(nd-1+ε), for any ε>0; the constant of proportionality depends on ε, d, and the shape and degree of the surface patches and of their boundaries.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A framework for cost-scaling algorithms for submodular flow problems

    Publication Year: 1993, Page(s):449 - 458
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (820 KB)

    The submodular flow problem includes such problems as minimum-cost network flow, dijoin, edge-connectivity orientation and others. We present a cost-scaling algorithm for submodular flow problems. The algorithm applies to these problems in general; we also examine its efficiency for the dijoin and edge-connectivity orientation problems. A minimum-cost dijoin is found in time O(min{m1/2,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Near-linear cost sequential and distributed constructions of sparse neighborhood covers

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

    This paper introduces the first near-linear (specifically, O(Elog n+nlog2 n)) time algorithm for constructing a sparse neighborhood cover in sequential and distributed environments. This automatically implies analogous improvements (from quadratic to near-linear) to all the results in the literature that rely on network decompositions, both in sequential and distributed domains, includi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synchronization power depends on the register size

    Publication Year: 1993, Page(s):196 - 205
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (792 KB)

    Though it is common practice to treat synchronization primitives for multiprocessors as abstract data types, they are in reality machine instructions on registers. A crucial theoretical question with practical implications is the relationship between the size of the register and its computational power. The authors study this question and choose as a first target the popular compare and swap opera... View full abstract»

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