Computing and Combinatorics [recurso electrónico] : 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings / edited by Thang N. Dinh, My T. Thai.
Tipo de material: TextoSeries Lecture Notes in Computer Science ; 9797Editor: Cham : Springer International Publishing : Imprint: Springer, 2016Descripción: XIII, 634 p. 98 illus. online resourceTipo de contenido: text Tipo de medio: computer Tipo de portador: online resourceISBN: 9783319426341Tema(s): Computer science | Computer communication systems | Computers | Algorithms | Mathematical logic | Computer science -- Mathematics | Artificial intelligence | Computer Science | Algorithm Analysis and Problem Complexity | Discrete Mathematics in Computer Science | Computation by Abstract Devices | Artificial Intelligence (incl. Robotics) | Computer Communication Networks | 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 |
Game Theory and Algorithms -- Parameterized Complexity and Algorithms -- Database and Data Structures -- Computational Complexity -- Approximation Algorithms -- Cryptography -- Network and Algorithms -- Graph Theory and Algorithms.-Computational Geometry -- Scheduling Algorithms and Circuit Complexity -- Computational Geometry and Computational Biology -- Logic, Algebra and Automata.
This book constitutes the refereed proceedings of the 22nd International Conference on Computing and Combinatorics, COCOON 2016, held in Ho Chi Minh City, Vietnam, in August 2016. The 50 revised full papers papers presented in this book were carefully reviewed and selected from various submissions. The papers cover various topics including: Theory and Algorithms; Parameterized Complexity and Algorithms; Database and Data Structures; Computational Complexity; Approximation Algorithms; Cryptography; Network and Algorithms; Graph Theory and Algorithms; Computational Geometry; Scheduling Algorithms and Circuit Complexity; Computational Geometry and Computational Biology; and Logic, Algebra and Automata.