Description
Computer Science -- Theory and Applications, 2015
10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings
Theoretical Computer Science and General Issues Series
Coordinators: Beklemishev Lev D., Musatov Daniil V.
Language: EnglishSubjects for Computer Science -- Theory and Applications:
Keywords
Approximation algorithms; Computational complexity; Discrete mathematics; Formal grammars; Graph algorithms; Graph theory; Kolmogorov complexity; Planar graph; Polynomial-time algorithms; Proof complexity; Reset complexity; Satisfiability of quantum circuits; Shift-reduce; Strongly connected automaton; Strongly polynomial algorithm; Synchronizing automaton; Theory of computation; Timed languages; Timed pushdown automata; Visibly pushdown languages
Support: Print on demand
Description
/li>Contents
/li>Comment
/li>
This book constitutes the proceedings of the 10th International Computer Science Symposium in Russia, CSR 2015, held in Listvyanka, Russia, in July 2015.
The 25 full papers presented in this volume were carefully reviewed and selected from 61 submissions. In addition the book contains 4 invited lectures. The scope of the proposed topics is quite broad and covers a wide range of areas in theoretical computer science and its applications.
Includes supplementary material: sn.pub/extras