Computer Science ? Theory and Applications [recurso electrónico] : 11th International Computer Science Symposium in Russia, CSR 2016, St. Petersburg, Russia, June 9-13, 2016, Proceedings / edited by Alexander S. Kulikov, Gerhard J. Woeginger.
Tipo de material: TextoSeries Lecture Notes in Computer Science ; 9691Editor: Cham : Springer International Publishing : Imprint: Springer, 2016Descripción: XXI, 425 p. 49 illus. online resourceTipo de contenido: text Tipo de medio: computer Tipo de portador: online resourceISBN: 9783319341712Tema(s): Computer science | Computers | Algorithms | Computer logic | Mathematical logic | Numerical analysis | Computer science -- Mathematics | Computer Science | Algorithm Analysis and Problem Complexity | Discrete Mathematics in Computer Science | Computation by Abstract Devices | Numeric Computing | Logics and Meanings of Programs | Mathematical Logic and Formal LanguagesFormatos físicos adicionales: Printed edition:: Sin títuloClasificación CDD: 005.1 Clasificación LoC:QA76.9.A43Recursos en línea: Libro electrónicoTipo de ítem | Biblioteca actual | Colección | Signatura | Copia número | Estado | Fecha de vencimiento | Código de barras |
---|---|---|---|---|---|---|---|
Libro Electrónico | Biblioteca Electrónica | Colección de Libros Electrónicos | 1 | No para préstamo |
Algorithms and data structures -- Combinatorial optimization -- Constraint solving -- Computational complexity -- Cryptography -- Combinatorics in computer science -- Formal languages and automata -- Computational models and concepts -- Algorithms for concurrent and distributed systems, networks -- Proof theory and applications of logic to computer science -- Model checking -- Automated reasoning -- Deductive methods.
This book constitutes the proceedings of the 11th International Computer Science Symposium in Russia, CSR 2016, held in St. Petersburg, Russia, in June 2016. The 28 full papers presented in this volume were carefully reviewed and selected from 71 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 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; computational models and concepts; algorithms for concurrent and distributed systems, networks; proof theory and applications of logic to computer science; model checking; automated reasoning; and deductive methods.