Scheduled System Maintenance
On Tuesday, January 23, IEEE Xplore will undergo scheduled maintenance from 1:00-4:00 PM ET.
During this time, there may be intermittent impact on performance. We apologize for any inconvenience.

Proceedings 38th Annual Symposium on Foundations of Computer Science

20-22 Oct. 1997

Filter Results

Displaying Results 1 - 25 of 65
  • Proceedings 38th Annual Symposium on Foundations of Computer Science

    Publication Year: 1997
    Request permission for commercial reuse | PDF file iconPDF (277 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 1997, Page(s):605 - 606
    Request permission for commercial reuse | PDF file iconPDF (94 KB)
    Freely Available from IEEE
  • Deciding properties of polynomials without factoring

    Publication Year: 1997, Page(s):46 - 55
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (888 KB)

    The polynomial time algorithm of Lenstra, Lenstra, and Lovasz (1982) for factoring integer polynomials and variants thereof have been widely used to show that various computational problems in number theory have polynomial time solutions. Among them is the problem of factoring polynomials over algebraic number fields, which is used itself as a major subroutine for several other algorithms. Althoug... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The competitive analysis of risk taking with applications to online trading

    Publication Year: 1997, Page(s):336 - 344
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    Competitive analysis is concerned with minimizing a relative measure of performance. When applied to financial trading strategies, competitive analysis leads to the development of strategies with minimum relative performance risk. This approach is too inflexible. Many investors are interested in managing their risk: they may be willing to increase their risk for some form of reward. They may also ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computable obstructions to wait-free computability

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

    Effectively computable obstructions are associated to a distributed decision task (ℐ,𝒪,Δ) in the asynchronous, wait-free, read-write shared-memory model. The key new ingredient of this work is the association of a simplicial complex 𝒯, the task complex, to the input-output relation d. The task determines a simplicial map α from 𝒯 to the input complex ℐ. The exi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Randomized and deterministic algorithms for the dimension of algebraic varieties

    Publication Year: 1997, Page(s):36 - 45
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (848 KB)

    We prove old and new results on the complexity of computing the dimension of algebraic varieties. In particular, we show that this problem is NP-complete in the Blum-Shub-Smale model of computation over C, that it admits a sO(1)DO(n) deterministic algorithm, and that for systems with integer coefficients it is in the Arthur-Merlin class under the Generalized Riemann Hypothesi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Truly online paging with locality of reference

    Publication Year: 1997, Page(s):326 - 335
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (824 KB)

    The access graph model for paging, defined by (Borodin et al., 1991) and studied in (Irani et al., 1992) has a number of troubling aspects. The access graph has to be known in advance to the paging algorithm and the memory required to represent the access graph itself may be very large. We present a truly online strongly competitive paging algorithm in the access graph model that does not have any... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two Decades of Temporal Logic: Achievements and Challenges

    Publication Year: 1997, Page(s): 78
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (104 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the complexity of a set-union problem

    Publication Year: 1997, Page(s):110 - 115
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (552 KB)

    We consider a simple data structure supporting the following operations: (i) create a new singleton set; (ii) create a new set which is the union of two pre-existing sets; (iii) determine whether a given element is in a particular set. We prove both lower and upper bounds for an implementation of such a data structure. In a restricted model we show that no deterministic implementation can be bette... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Beyond the flow decomposition barrier

    Publication Year: 1997, Page(s):2 - 11
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (832 KB)

    We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual are capacities. Our approach leads to an O(min(n 2/3, m1/2)m log(n2/m) log U) time bound for a network with n vertices, m arcs, and integral arc capacities in the range [1,…,U]. This is a fundamental impro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Flows in undirected unit capacity networks

    Publication Year: 1997, Page(s):32 - 34
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (252 KB)

    We describe an O(min(m, n3/2)m1/2)-time algorithm for finding maximum flows in undirected networks with unit capacities and no parallel edges. This improves upon the previous bound of Karzanov and Even and Tarjan when m=ω(n3/2), and upon a randomized bound of Karger when υ=Ω(n7/4/m 1/2) View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nearly tight bounds on the learnability of evolution

    Publication Year: 1997, Page(s):524 - 533
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (952 KB)

    Evolution is often modeled as a stochastic process which modifies DNA. One of the most popular and successful such processes are the Cavender-Farris (CF) trees, which are represented as edge weighted trees. The Phylogeny Construction Problem is that of, given κ samples drawn from a CF tree, output a CF tree which is close to the original. Each CF tree naturally defines a random variable, and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • No feasible interpolation for TC0-Frege proofs

    Publication Year: 1997, Page(s):254 - 263
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (752 KB)

    The interpolation method has been one of the main tools for proving lower bounds for propositional proof systems. Loosely speaking, if one can prove that a particular proof system has the feasible interpolation property, then a generic reduction can (usually) be applied to prove lower bounds for the proof system, sometimes assuming a (usually modest) complexity-theoretic assumption. In this paper,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New directions in cryptography: twenty some years later (or cryptograpy and complexity theory: a match made in heaven)

    Publication Year: 1997, Page(s):314 - 324
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (836 KB)

    Diffie and Hellman (1976) published their fundamental paper on new directions in cryptography, in which they announced that “we stand on the brink of a revolution in cryptography”. Twenty some years later, we survey some of the progress made in cryptography during this time. We especially focus on the successful interplay between complexity theory and cryptography, witnessed perhaps mo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal-resilience proactive public-key cryptosystems

    Publication Year: 1997, Page(s):384 - 393
    Cited by:  Papers (43)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1004 KB)

    We introduce new efficient techniques for sharing cryptographic functions in a distributed dynamic fashion. These techniques dynamically and securely transform a distributed function (or secret sharing) representation between t-out-of-l (polynomial sharing) and t-out-of-t (additive sharing). We call the techniques poly-to-sum and sum-to-poly, respectively. Employing these techniques, we solve a nu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hamiltonian cycles in solid grid graphs

    Publication Year: 1997, Page(s):496 - 505
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (824 KB)

    A grid graph is a finite node induced subgraph of the infinite two dimensional integer grid. A solid grid graph is a grid graph without holes. For general grid graphs, the Hamiltonian cycle problem is known to be NP complete. We give a polynomial time algorithm for the Hamiltonian cycle problem in solid grid graphs, resolving a longstanding open question posed by A. Itai et al. (1982). In fact, ou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the power of quantum finite state automata

    Publication Year: 1997, Page(s):66 - 75
    Cited by:  Papers (72)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (816 KB)

    In this paper, we introduce 1-way and 2-way quantum finite state automata (1qfa's and 2qfa's), which are the quantum analogues of deterministic, nondeterministic and probabilistic 1-way and 2-way finite state automata. We prove the following facts regarding 2qfa's. 1. For any ε>0, there is a 2qfa M which recognizes the non-regular language L={ambm|m⩾1} with (one-s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Alternating-time temporal logic

    Publication Year: 1997, Page(s):100 - 109
    Cited by:  Papers (57)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (984 KB)

    Temporal logic comes in two varieties: linear-time temporal logic assumes implicit universal quantification over all paths that are generated by system moves; branching-time temporal logic allows explicit existential and universal quantification over all paths. We introduce a third, more general variety of temporal logic: alternating-time temporal logic offers selective quantification over those p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A faster deterministic algorithm for minimum spanning trees

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

    A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m α log α), where α=α(m,n) is a functional inverse of Ackermann's function and n (resp. m) is the number of vertices (resp. edges). This improves on the previous, ten-year old bound of (roughly) O(m log log* m) View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallelizing elimination orders with linear fill

    Publication Year: 1997, Page(s):274 - 283
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1080 KB)

    This paper presents an algorithm for finding parallel elimination orders for Gaussian elimination. Viewing a system of equations as a graph, the algorithm can be applied directly to interval graphs and chordal graphs. For general graphs, the algorithm can be used to parallelize the order produced by some other heuristic such as minimum degree. In this case, the algorithm is applied to the chordal ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Learning noisy perceptrons by a perceptron in polynomial time

    Publication Year: 1997, Page(s):514 - 523
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (768 KB)

    Learning perceptrons (linear threshold functions) from labeled examples is an important problem in machine learning. We consider the problem where labels are subjected to random classification noise. The problem was known to be PAC learnable via a hypothesis that consists of a polynomial number of linear thresholds (due to A. Blum, A. Frieze, R. Kannan, and S. Vempala (1996)). The question of whet... View full abstract»

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

    Publication Year: 1997, Page(s):244 - 253
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (776 KB)

    We show that in the context of nonuniform complexity, nondeterministic logarithmic space bounded computation can be made unambiguous. An analogous result holds for the class of problems reducible to context-free languages. In terms of complexity classes, this can be stated as: NL/poly=UL/poly LogCFL/poly=UAuxPDA(log n, nO(1))/poly View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal suffix tree construction with large alphabets

    Publication Year: 1997, Page(s):137 - 143
    Cited by:  Papers (66)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB)

    The suffix tree of a string is the fundamental data structure of combinatorial pattern matching. Weiner (1973), who introduced the data structure, gave an O(n)-time algorithm for building the suffix tree of an n-character string drawn from a constant size alphabet. In the comparison model, there is a trivial Ω(n log n)-time lower bound based on sorting, and Weiner's algorithm matches this bo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Global optimization using local information with applications to flow control

    Publication Year: 1997, Page(s):303 - 312
    Cited by:  Papers (21)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (824 KB)

    Flow control in high speed networks requires distributed routers to make fast decisions based only on local information in allocating bandwidth to connections. While most previous work on this problem focuses on achieving local objective functions, in many cases it may be necessary to achieve global objectives such as maximizing the total flow. This problem illustrates one of the basic aspects of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Path coupling: A technique for proving rapid mixing in Markov chains

    Publication Year: 1997, Page(s):223 - 231
    Cited by:  Papers (49)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (764 KB)

    The main technique used in algorithm design for approximating heart of the method is the study of the convergence (mixing) rates of particular Markov chains of interest. In this paper we illustrate a new approach to the coupling technique, which we call path coupling, for bounding mixing rates. Previous applications of coupling have required detailed insights into the combinatorics of the problem ... View full abstract»

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