Skip to main content
SpringerLink
Log in
Book cover

Fundamentals of Computation Theory

13th International Symposium, FCT 2001, Riga, Latvia, August 22-24, 2001. Proceedings

  • Conference proceedings
  • © 2001

Overview

Editors:
  1. Rūsiņš Freivalds

    1. University of Latvia, Riga, Latvia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2138)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (60 papers)

  1. Front Matter

    Pages I-XIII
    Download chapter PDF

  2. Invited Papers

    1. Towards Axiomatic Basis of Inductive Inference

      • Jānis Bārzdiņš, Rūsiņš Freivalds, Carl H. Smith
      Pages 1-13

    2. Approximation Algorithms for Fractional Covering and Packing Problems, and Applications

      • Klaus Jansen
      Pages 14-14

    3. Challenges of Commutation

      • Juhani Karhumäki
      Pages 15-23

    4. Approximating Bounded Degree Instances of NP-Hard Problems

      • Marek Karpinski
      Pages 24-34

    5. Universal Algebra and Computer Science

      • Boris Plotkin, Tanya Plotkin
      Pages 35-44

    6. Quantum Algorithms

      • Umesh Vazirani
      Pages 45-46

  3. Regular Papers

    1. A Discrete Approximation and Communication Complexity Approach to the Superposition Problem

      • Farid Ablayev, Svetlana Ablayeva
      Pages 47-58

    2. On Computational Power of Quantum Branching Programs

      • Farid Ablayev, Aida Gainutdinova, Marek Karpinski
      Pages 59-70

    3. Efficient Computation of Singular Moduli with Application in Cryptography

      • Harald Baier
      Pages 71-82

    4. Ambainis-Freivalds’ Algorithm for Measure-Once Automata

      • Aija Bērziņa, Richard Bonner
      Pages 83-93

    5. Are There Essentially Incomplete Knowledge Representation Systems?

      • Jānis Cīrulis
      Pages 94-105

    6. Best Increments for the Average Case of Shellsort

      • Marcin Ciura
      Pages 106-117

    7. Approximating Minimum Cocolourings

      • Fedor V. Fomin, Dieter Kratsch, Jean-Christophe Novelli
      Pages 118-125

    8. Curved Edge Routing

      • Kārlis Freivalds
      Pages 126-137

    9. Time/Space Efficient Compressed Pattern Matching

      • Leszek Gasieniec, Igor Potapov
      Pages 138-149

    10. Modelling Change with the Aid of Knowledge and Time

      • Bernhard Heinemann
      Pages 150-161

    11. If P ≠ NP then Some Strongly Noninvertible Functions Are Invertible

      • Lane A. Hemaspaandra, Kari Pasanen, Jörg Rothe
      Pages 162-171

    12. Prediction-Preserving Reducibility with Membership Queries on Formal Languages

      • Kouichi Hirata, Hiroshi Sakamoto
      Pages 172-183

    13. Dense Families and Key Functions of Database Relation Instances

      • Jouni Järvinen
      Pages 184-192
Back to top

Keywords

Editors and Affiliations

  • University of Latvia, Riga, Latvia

    Rūsiņš Freivalds

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation