ENGLISH

Fundamentals of Computation Theory: 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003. Proceedings

By Sanjeev Arora (auth.) , Andrzej Lingas , Bengt J. Nilsson (eds.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2003
ISBN
978-3-540-40543-6, 978-3-540-45077-1, 3-540-40543-7
DOI
10.1007/b11926
Language
english
Format
PDF
Filesize
4 MB (4634571 bytes)
Series
Lecture Notes in Computer Science 2751
Edition
1
Pages
440\444
Time added
2014-01-18 08:00:00
Algorithm Analysis and Problem Complexity; Computa

Description

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.

Similar books