This book constitutes the refereed proceedings of the 15th International Symposium Fundamentals of Computation Theory, FCT 2005, held in LA¼beck, Germany in August 2005. The 46 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 105 submissions. The papers are organized in topical sections on circuits, automata, complexity, approximability, computational and structural complexity, graphs and complexity, computational game theory, visual cryptography and computational geometry, query complexity, distributed systems, automata and formal languages, semantics, approximation algorithms, average case complexity, algorithms, graph algorithms, and pattern matching.to find a path, we do not know how to do this in logarithmic space for directed graphs, but Reingold  has shown how to ... However, the study of OptL suffers from the same problem as the study of OptP: In Krentela#39;s approach an optimizationanbsp;...
|Title||:||Fundamentals of Computation Theory|
|Author||:||Maciej Liskiewicz, Rüdiger Reischuk|
|Publisher||:||Springer Science & Business Media - 2005-08-04|