Mathematical Foundations of Computer Science 2004: 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004, Proceedings

Front Cover
Jirí Fiala, Václav Koubek, Jan Kratochvíl
Springer, Oct 5, 2004 - Computers - 902 pages
This book constitutes the refereed proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science, MFCS 2004, held in Prague, Czech Republic in August 2004. The 60 revised full papers presented together with full papers or abstracts of 10 invited talks were carefully reviewed and selected from 167 submissions. The papers are organised in topical sections on graph algorithms, approximation, graphs and complexity, circuits, general complexity, automata, parameterized and kolmogrov complexity, semantics, scheduling, algebraic theory of languages, games, languages, geometry, languages and complexity, quantum computing, and XML.

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Invited Lectures
1
Problems and Techniques
25
Polynomial Time Approximation Schemes
28
Copyright

46 other sections not shown

Other editions - View all

Common terms and phrases

Bibliographic information