Ebook: Fundamentals of Computation Theory: 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003. Proceedings
- Genre: Mathematics // Computational Mathematics
- Tags: Algorithm Analysis and Problem Complexity, Computation by Abstract Devices, Mathematical Logic and Formal Languages, Discrete Mathematics in Computer Science, Computer Graphics
- Series: Lecture Notes in Computer Science 2751
- Year: 2003
- Publisher: Springer-Verlag Berlin Heidelberg
- Edition: 1
- Language: English
- pdf
This book constitutes the refereed proceedings of the 14th International Symposium Fundamentals of Computation Theory, FCT 2003, held in Malm?, Sweden in August 2003.
The 36 revised full papers presented together with an invited paper and the abstracts of 2 invited talks were carefully reviewed and selected from 73 submissions. The papers are organized in topical sections on approximibility, algorithms, networks and complexity, computational biology, computational geometry, computational models and complexity, structural complexity, formal languages, and logic.
This book constitutes the refereed proceedings of the 14th International Symposium Fundamentals of Computation Theory, FCT 2003, held in Malm?, Sweden in August 2003. The 36 revised full papers presented together with an invited paper and the abstracts of 2 invited talks were carefully reviewed and selected from 73 submissions. The papers are organized in topical sections on approximibility, algorithms, networks and complexity, computational biology, computational geometry, computational models and complexity, structural complexity, formal languages, and logic.
Download the book Fundamentals of Computation Theory: 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003. Proceedings for free or read online
Continue reading on any device:
Last viewed books
Related books
{related-news}
Comments (0)