Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science

22-24 Oct. 1990

Filter Results

Displaying Results 1 - 25 of 92
  • No better ways to generate hard NP instances than picking uniformly at random

    Publication Year: 1990, Page(s):812 - 821 vol.2
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    Distributed NP (DNP) problems are ones supplied with probability distributions of instances. It is shown that every DNP problem complete for P-time computable distributions is also complete for all distributions that can be sampled. This result makes the concept of average-case NP completeness robust and the question of the average-case complexity of complete DNP problems a natural alternative to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Proceedings. 31st Annual Symposium on Foundations of Computer Science (Cat. No.90CH2925-6)

    Publication Year: 1990
    Request permission for commercial reuse | PDF file iconPDF (92 KB)
    Freely Available from IEEE
  • Permuting

    Publication Year: 1990, Page(s):372 - 379 vol.1
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (612 KB)

    The fundamental problem of permuting the elements of an array according to some given permutation is addressed. The goal is to perform the permutation quickly using only a polylogarithmic number of bits of extra storage. The main result is an O(n log n)-time, O(log2n)-space worst case method. A simpler method is presented for the case in whic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the predictability of coupled automata: an allegory about chaos

    Publication Year: 1990, Page(s):788 - 793 vol.2
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (484 KB)

    The authors show a sharp dichotomy between systems of identical automata with symmetric global control whose behavior is easy to predict and those whose behavior is hard to predict. The division pertains to whether the global control rule is invariant with respect to permutations of the states of the automaton. It is also shown that testing whether the global control rule has this invariance prope... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Inferring evolutionary history from DNA sequences

    Publication Year: 1990, Page(s):362 - 371 vol.1
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (728 KB)

    Two related problems are considered. The first is determining whether it is possible to triangulate a vertex-colored graph without introducing edges between vertices of the same color. This is related to a fundamental problem for geneticists, that of using character state information to construct evolutionary trees. The polynomial equivalence of these problems is demonstrated. An important subprob... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Drawing graphs in the plane with high resolution

    Publication Year: 1990, Page(s):86 - 95 vol.1
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (580 KB)

    The problem of drawing a graph in the plane so that edges appear as straight lines and the minimum angle formed by any pair of incident edges is maximized is studied. The resolution of a layout is defined to be the size of the minimum angle formed by incident edges of the graph, and the resolution of a graph is defined to be the maximum resolution of any layout of the graph. The resolution R View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Provably good mesh generation

    Publication Year: 1990, Page(s):231 - 241 vol.1
    Cited by:  Papers (16)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (892 KB)

    Several versions of the problem of generating triangular meshes for finite-element methods are studied. It is shown how to triangulate a planar point set or a polygonally bounded domain with triangles of bounded aspect ratio, how to triangulate a planar point set with triangles having no obtuse angles, how to triangulate a point set in arbitrary dimension with simplices of bounded aspect ratio, an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The complexity of finding medians

    Publication Year: 1990, Page(s):778 - 787 vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB)

    PF(#P) is characterized in a manner similar to M.W. Krentel's (1988) characterization of Pf(NP). If MidP is the class of functions that give the medians in the outputs of metric Turing machines, then it is shown that every function in PF(#P) is polynomial time 1-Turing reducible to a function in MidP and MidP⊆PF(#P); that is, PF(#P)=PF(MidP[1]). Intuitively, finding medians is as hard computa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploring an unknown graph

    Publication Year: 1990, Page(s):355 - 361 vol. 1
    Cited by:  Papers (19)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (452 KB)

    It is desired to explore all edges of an unknown directed, strongly connected graph. At each point one has a map of all nodes and edges visited, one can recognize these nodes and edges upon seeing them again, and it is known how many unexplored edges emanate from each node visited. The goal is to minimize the ratio of the total number of edges traversed to the optimum number of traversals had the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An approach for proving lower bounds: solution of Gilbert-Pollak's conjecture on Steiner ratio

    Publication Year: 1990, Page(s):76 - 85 vol.1
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB)

    A family of finitely many continuous functions on a polytope X , namely {gi(x)}i∈I, is considered, and the problem of minimizing the function f(x)=maxi∈Igi( x) on X is treated. It is shown that if every g i(x) is a concave function, then the min... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A (fairly) simple circuit that (usually) sorts

    Publication Year: 1990, Page(s):264 - 274 vol.1
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (816 KB)

    A natural k-round tournament over n=2k players is analyzed, and it is demonstrated that the tournament possesses a surprisingly strong ranking property. The ranking property of this tournament is exploited by being used as a building block for efficient parallel sorting algorithms under a variety of different models of computation. Three important applications are prov... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Triangulating a simple polygon in linear time

    Publication Year: 1990, Page(s):220 - 230 vol.1
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (984 KB)

    A linear-time deterministic algorithm for triangulating a simple polygon is developed. The algorithm is elementary in that it does not require the use of any complicated data structures; in particular, it does not need dynamic search trees, finger trees, or fancy point location structures View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bounds on tradeoffs between randomness and communication complexity

    Publication Year: 1990, Page(s):766 - 775 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB)

    A quantitative investigation of the power of randomness in the context of communication complexity is initiated. The authors prove general lower bounds on the length of the random input of parties computing a function f, depending on the number of bits communicated and the deterministic communication complexity of f. Four standard models for communication complexity are considere... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algebraic methods for interactive proof systems

    Publication Year: 1990, Page(s):2 - 10 vol.1
    Cited by:  Papers (43)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (556 KB)

    An algebraic technique for the construction of interactive proof systems is proposed. The technique is used to prove that every language in the polynomial-time hierarchy has an interactive proof system. For the proof, a method is developed for reducing the problem of verifying the value of a low-degree polynomial at two points to verifying the value at one new point. The results have implications ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constructing generalized universal traversing sequences of polynomial size for graphs with small diameter

    Publication Year: 1990, Page(s):439 - 448 vol.1
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (524 KB)

    A generalized version of universal traversing sequences is constructed. The generalization preserves the features of the universal traversing sequences that make them attractive for applications to derandomizations and space-bounded computation. For every n, there is constructed a sequence that is used by a finite automaton with O(1) states in order to traverse all the n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Online algorithms for finger searching

    Publication Year: 1990, Page(s):480 - 489 vol.2
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB)

    The technique of speeding up access into search structures by maintaining fingers that point to various locations of the search structure is considered. The problem of choosing, in a large search structure, locations at which to maintain fingers is treated. In particular, a server problem in which k servers move along a line segment of length m, where m is the number of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient parallel algorithms for tree-decomposition and related problems

    Publication Year: 1990, Page(s):173 - 182 vol.1
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    An efficient parallel algorithm for the tree-decomposition problem for fixed width w is presented. The algorithm runs in time O(log3 n) and uses O(n) processors on a concurrent-read, concurrent-write parallel random access machine (CRCW PRAM). This result can be used to construct efficient parallel algorithms for three important classes of pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The mixing rate of Markov chains, an isoperimetric inequality, and computing the volume

    Publication Year: 1990, Page(s):346 - 354 vol. 1
    Cited by:  Papers (23)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    A. Sinclair and M. Jerrum (1988) derived a bound on the mixing rate of time-reversible Markov chains in terms of their conductance. The authors generalize this result by not assuming time reversibility and using a weaker notion of conductance. They prove an isoperimetric inequality for subsets of a convex body. These results are combined to simplify an algorithm of M. Dyer et al. (1989) for approx... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A dining philosophers algorithm with polynomial response time

    Publication Year: 1990, Page(s):65 - 74 vol.1
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (828 KB)

    Presents an efficient distributed online algorithm for scheduling jobs that are created dynamically, subject to resource constraints that require that certain pairs of jobs not run concurrently. The focus is on the response time of the system to each job, i.e. the length of the time interval that starts when the job is created or assigned to a processor and ends at the instant the execution of the... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The lattice reduction algorithm of Gauss: an average case analysis

    Publication Year: 1990, Page(s):830 - 839 vol.2
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB)

    The lattice reduction algorithm of Gauss is shown to have an average-case complexity that is asymptotic to a constant. The analysis makes use of elementary properties of continued fractions and of linear fractional transformations View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the exact complexity of string matching

    Publication Year: 1990, Page(s):135 - 144 vol.1
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    The maximal number of character comparisons made by a linear-time string matching algorithm, given a text string of length n and a pattern string of length m over a general alphabet, is investigated. The number is denoted by c(n,m) or approximated by (1+C)n, where C is a universal constant. The subscript `online' is added when... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decision problems for propositional linear logic

    Publication Year: 1990, Page(s):662 - 671 vol.2
    Cited by:  Papers (13)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    It is shown that, unlike most other propositional (quantifier-free) logics, full propositional linear logic is undecidable. Further, it is provided that without the model storage operator, which indicates unboundedness of resources, the decision problem becomes PSPACE-complete. Also established are membership in NP for the multiplicative fragment, NP-completeness for the multiplicative fragment ex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Markovian extension of Valiant's learning model

    Publication Year: 1990, Page(s):392 - 396 vol.1
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 KB)

    A model of learning that expands on the Valiant model is introduced. The point of departure from the Valiant model is that the learner is placed in a Markovian environment. The environment of the learner is a (exponentially large) graph, and the examples reside on the vertices of the graph, one example on each vertex. The learner obtains the examples while performing a random walk on the graph. At... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hidden surface removal for axis-parallel polyhedra

    Publication Year: 1990, Page(s):252 - 261 vol.1
    Cited by:  Patents (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (812 KB)

    An efficient, output-sensitive method for computing the visibility map of a set of axis-parallel polyhedra (i.e. polyhedra with their faces and edges parallel to the coordinate axes) as seen from a given viewpoint is introduced. For nonintersecting polyhedra with n edges in total, the algorithm runs in time O((n+k )log n), where k is the comple... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotically tight bounds for computing with faulty arrays of processors

    Publication Year: 1990, Page(s):285 - 296 vol.1
    Cited by:  Papers (22)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (980 KB)

    The computational power of 2-D and 3-D processor arrays that contain a potentially large number of faults is analyzed. Both a random and a worst-case fault model are considered, and it is proved that in either scenario low-dimensional arrays are surprisingly fault tolerant. It is also shown how to route, sort, and perform systolic algorithms for problems such as matrix multiplication in optimal ti... View full abstract»

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