Skip to main content
SpringerLink
Log in
Book cover

Mathematical Foundations of Computer Science 2004

29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings

  • Conference proceedings
  • © 2004

Overview

Editors:
  1. Jiří Fiala

    1. Institute for Theoretical Computer Science and Department of Applied Mathematics, Charles University, Prague, Czech Republic

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Václav Koubek

    1. Department of Theoretical Computer Science and Mathematical Logic, Faculty of Mathematics and Physics, Charles University, Praha1, Czech Republic

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Jan Kratochvíl

    1. Institute for Theoretical Computer Science and Department of Applied Mathematics, Charles University, Prague, 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 3153)

Included in the following conference series:

Conference proceedings info: MFCS 2004.

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 (70 papers)

  1. Graphs and Complexity

    1. Complexity Results in Graph Reconstruction

      • Edith Hemaspaandra, Lane A. Hemaspaandra, Stanisław Radziszowski, Rahul Tripathi
      Pages 287-297

    2. Generating Paths and Cuts in Multi-pole (Di)graphs

      • Endre Boros, Khaled Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino
      Pages 298-309

    3. Packing Directed Cycles Efficiently

      • Zeev Nutov, Raphael Yuster
      Pages 310-321

  2. Circuits

    1. The Complexity of Membership Problems for Circuits over Sets of Integers

      • Stephen D. Travers
      Pages 322-333

    2. Some Meet-in-the-Middle Circuit Lower Bounds

      • Kristoffer Arnsfelt Hansen, Peter Bro Miltersen
      Pages 334-345

    3. The Enumerability of P Collapses P to NC

      • Alina Beygelzimer, Mitsunori Ogihara
      Pages 346-355

    4. On NC1 Boolean Circuit Composition of Non-interactive Perfect Zero-Knowledge

      • Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano
      Pages 356-367

  3. General Complexity

    1. All Superlinear Inverse Schemes Are coNP-Hard

      • Edith Hemaspaandra, Lane A. Hemaspaandra, Harald Hempel
      Pages 368-379

    2. The Complexity of Equivalence and Isomorphism of Systems of Equations over Finite Groups

      • Gustav Nordh
      Pages 380-391

    3. Generation Problems

      • Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus Wagner
      Pages 392-403

    4. One Query Reducibilities Between Partial Information Classes

      • Sebastian Bab, Arfst Nickelsen
      Pages 404-415

  4. Automata

    1. A New Dimension Sensitive Property for Cellular Automata

      • Vincent Bernardi, Bruno Durand, Enrico Formenti, Jarkko Kari
      Pages 416-426

    2. Captive Cellular Automata

      • Guillaume Theyssier
      Pages 427-438

    3. Simulating 3D Cellular Automata with 2D Cellular Automata

      • Victor Poupet
      Pages 439-450

    4. Graph Exploration by a Finite Automaton

      • Pierre Fraigniaud, David Ilcinkas, Guy Peer, Andrzej Pelc, David Peleg
      Pages 451-462

  5. Parametrized and Kolmogorov Complexity

    1. On Polynomially Time Bounded Symmetry of Information

      • Troy Lee, Andrei Romashchenko
      Pages 463-475

    2. Scaled Dimension and the Kolmogorov Complexity of Turing-Hard Sets

      • John M. Hitchcock, María López-Valdés, Elvira Mayordomo
      Pages 476-487

    3. A Geometric Approach to Parameterized Algorithms for Domination Problems on Planar Graphs

      • Henning Fernau, David Juedes
      Pages 488-499

    4. Polynomial Time Approximation Schemes and Parameterized Complexity

      • Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia
      Pages 500-512

  6. Semantics

    1. Epistemic Foundation of the Well-Founded Semantics over Bilattices

      • Yann Loyer, Umberto Straccia
      Pages 513-524
Back to top

Other volumes

  1. Mathematical Foundations of Computer Science 2004

Keywords

About this book

This volume contains the papers presented at the 29th Symposium on Mat- matical Foundations of Computer Science, MFCS 2004, held in Prague, Czech Republic, August 22–27, 2004. The conference was organized by the Institute for Theoretical Computer Science (ITI) and the Department of Theoretical Com- terScienceandMathematicalLogic(KTIML)oftheFacultyofMathematicsand Physics of Charles University in Prague. It was supported in part by the Eu- pean Association for Theoretical Computer Science (EATCS) and the European Research Consortium for Informatics and Mathematics (ERCIM). Traditionally, the MFCS symposia encourage high-quality research in all branches of theoretical computer science. Ranging in scope from automata, f- mal languages, data structures, algorithms and computational geometry to c- plexitytheory,modelsofcomputation,andapplicationsincludingcomputational biology, cryptography, security and arti?cial intelligence, the conference o?ers a unique opportunity to researchers from diverse areas to meet and present their results to a general audience. The scienti?c program of this year’s MFCS took place in the lecture halls of the recently reconstructed building of the Faculty of Mathematics and P- sics in the historical center of Prague, with the famous Prague Castle and other celebratedhistoricalmonumentsinsight.Theviewfromthewindowswasach- lengingcompetitionforthespeakersinthe?ghtfortheattentionoftheaudience. But we did not fear the result: Due to the unusually tough competition for this year’s MFCS, the admitted presentations certainly attracted considerable in- rest. The conference program (and the proceedings) consisted of 60 contributed papers selected by the Program Committee from a total of 167 submissions.

Editors and Affiliations

  • Institute for Theoretical Computer Science and Department of Applied Mathematics, Charles University, Prague, Czech Republic

    Jiří Fiala, Jan Kratochvíl

  • Department of Theoretical Computer Science and Mathematical Logic, Faculty of Mathematics and Physics, Charles University, Praha1, Czech Republic

    Václav Koubek

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation