
Choice Made Simple!
Too many options?Click below to purchase an online gift card that can be used at participating retailers in Village Green Shopping Centre and continue your shopping IN CENTRE!Purchase HereHome
Computer Science - Theory and Applications: 12th International Symposium Russia, CSR 2017, Kazan, June 8-12, Proceedings
Coles
Loading Inventory...
Computer Science - Theory and Applications: 12th International Symposium Russia, CSR 2017, Kazan, June 8-12, Proceedings in Vernon, BC
By None
Current price: $64.99
Original price: $80.62

Coles
Computer Science - Theory and Applications: 12th International Symposium Russia, CSR 2017, Kazan, June 8-12, Proceedings in Vernon, BC
By None
Current price: $64.99
Original price: $80.62
Loading Inventory...
Size: Kobo eBook
*Product information may vary - to confirm product availability, pricing, shipping and return information please contact Coles
This book constitutes the proceedings of the 12th International Computer Science Symposium in Russia, CSR 2017, held in Kazan, Russia, in June 2017. The 22 full papers presented in this volume were carefully reviewed and selected from 44 submissions. In addition the book contains 6 invited lectures. The scope of the proposed topics is quite broad and covers a wide range of areas such as: include, but are not limited to: algorithms and data structures; combinatorial optimization; constraint solving; computational complexity; cryptography; combinatorics in computer science; formal languages and automata; algorithms for concurrent and distributed systems, networks; applications of logic to computer science, e.g. proof theory, model checking and verification; formal and algorithmic aspects of bio-informatics; current challenges such as quantum computing.
This book constitutes the proceedings of the 12th International Computer Science Symposium in Russia, CSR 2017, held in Kazan, Russia, in June 2017. The 22 full papers presented in this volume were carefully reviewed and selected from 44 submissions. In addition the book contains 6 invited lectures. The scope of the proposed topics is quite broad and covers a wide range of areas such as: include, but are not limited to: algorithms and data structures; combinatorial optimization; constraint solving; computational complexity; cryptography; combinatorics in computer science; formal languages and automata; algorithms for concurrent and distributed systems, networks; applications of logic to computer science, e.g. proof theory, model checking and verification; formal and algorithmic aspects of bio-informatics; current challenges such as quantum computing.



















