Skip to main content
SpringerLink
Log in

Mathematical Foundations of Computer Science 2001

26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001 Proceedings

  • Conference proceedings
  • © 2001

Overview

Editors:
  1. Jiří Sgall

    1. Mathematical Institute, AS CR, Praha 1, Czech Republic

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Aleš Pultr

    1. Faculty of Mathematics and Physics Institute for Theoretical Computer Science (ITI), Charles University, Praha 1, Czech Republic

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Petr Kolman

    1. Faculty of Mathematics and Physics Institute for Theoretical Computer Science (ITI), Charles University, Praha 1, Czech Republic

    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 2136)

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.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 (61 papers)

  1. Front Matter

    Pages I-XII
    Download chapter PDF

  2. Invited Talks

    1. A New Category for Semantics

      • Dana S. Scott
      Pages 1-2

    2. On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity

      • Peter Bürgisser
      Pages 3-17

    3. Playing Games with Algorithms: Algorithmic Combinatorial Game Theory

      • Erik D. Demaine
      Pages 18-33

    4. Some Recent Results on Data Mining and Search

      • Amos Fiat
      Pages 33-36

    5. Hypertree Decompositions: A Survey

      • Georg Gottlob, Nicola Leone, Francesco Scarcello
      Pages 37-57

    6. The Strength of Non-size-increasing Computation (Introduction and Summary)

      • Martin Hofmann
      Pages 58-61

    7. Introduction to Recent Quantum Algorithms

      • Peter Høyer
      Pages 62-74

    8. Decomposition Methods and Sampling Circuits in the Cartesian Lattice

      • Dana Randall
      Pages 74-86

    9. New Algorithms for k-SAT Based on the Local Search Principle

      • Uwe Schöning
      Pages 87-95

    10. Linear Temporal Logic and Finite Semigroups

      • Thomas Wilke
      Pages 96-110

  3. Contributed Talks

    1. Refined Search Tree Technique for Dominating Set on Planar Graphs

      • Jochen Alber, Hongbing Fan, Michael R. Fellows, Henning Fernau, Rolf Niedermeier, Fran Rosamond et al.
      Pages 111-123

    2. The Computational Power of a Family of Decision Forests

      • Kazuyuki Amano, Tsukuru Hirosawa, Yusuke Watanabe, Akira Maruoka
      Pages 123-134

    3. Exact Results for Accepting Probabilities of Quantum Automata

      • Andris Ambainis, Arnolds Ķikusts
      Pages 135-147

    4. Improved Bounds on the Weak Pigeonhole Principle and Infinitely Many Primes from Weaker Axioms

      • Albert Atserias
      Pages 148-158

    5. Analysis Problems for Sequential Dynamical Systems and Communicating State Machines

      • Chris Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard E. Stearns
      Pages 159-172

    6. The Complexity of Tensor Circuit Evaluation

      • Martin Beaudry, Markus Holzer
      Pages 173-185

    7. Computing Reciprocals of Bivariate Power Series

      • Markus Bläser
      Pages 186-197

    8. Automatic Verification of Recursive Procedures with One Integer Parameter

      • Ahmed Bouajjani, Peter Habermehl, Richard Mayr
      Pages 198-211

    9. Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds

      • Henrik Brosenne, Matthias Homeister, Stephan Waack
      Pages 212-223
Back to top

Keywords

Editors and Affiliations

  • Mathematical Institute, AS CR, Praha 1, Czech Republic

    Jiří Sgall

  • Faculty of Mathematics and Physics Institute for Theoretical Computer Science (ITI), Charles University, Praha 1, Czech Republic

    Aleš Pultr, Petr Kolman

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation