| ![](/p.gif) |
![](/p.gif) |
| Artikel-Nr.: 5667A-9783540602460 Herst.-Nr.: 9783540602460 EAN/GTIN: 9783540602460 |
| |
|
| ![](/p.gif) | ![](/p.gif) |
![](/p.gif) | This book presents the proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science, MFCS'95, held in Prague, Czech Republic in August/September 1995. The book contains eight invited papers and two abstracts of invited talks by outstanding scientists as well as 44 revised full research papers selected from a total of 104 submissions. All relevant aspects of theoretical computer science are addressed, particularly the mathematical foundations; the papers are organized in sections on structural complexity, algorithms, complexity theory, graphs in models of computation, lower bounds, formal languages, unification, rewriting and type theory, distributed computation, concurrency, semantics, model checking, and formal calculi. Weitere Informationen: ![](/p.gif) | ![](/p.gif) | Author: | Jiri Wiedermann; Petr Hajek | Verlag: | Springer Berlin | Sprache: | eng |
|
| ![](/p.gif) | ![](/p.gif) |
![](/p.gif) | | ![](/p.gif) | ![](/p.gif) |
![](/p.gif) | Weitere Suchbegriffe: EDV / Theorie / Informatik / Mathematik, Mathematik / Informatik, Computer, algorithm; algorithms; complexity; complexitytheory; formallanguage; modelchecking; Semantics; algorithmanalysisandproblemcomplexity, algorithm, algorithms, complexity, complexity theory, formal language, model checking, semantics, algorithm analysis and problem complexity |
| ![](/p.gif) | ![](/p.gif) |
| |