Cantitate/Preț
Produs

Computing and Combinatorics: 20th International Conference, COCOON 2014, Atlanta, GA, USA, August 4-6, 2014, Proceedings: Lecture Notes in Computer Science, cartea 8591

Editat de Zhipeng Cai, Alexander Zelikovsky, Anu Bourgeois
en Limba Engleză Paperback – aug 2014
This book constitutes the refereed proceedings of the 20th International Conference on Computing and Combinatorics, COCOON 2014, held in Atlanta, GA, USA, in August 2014. The 51 revised full papers presented were carefully reviewed and selected from 110 submissions. There was a co-organized workshop on computational social networks (CSoNet 2014) where 8 papers were accepted. The papers cover the following topics: sampling and randomized methods; logic, algebra and automata; database and data structures; parameterized complexity and algorithms; computational complexity; computational biology and computational geometry; approximation algorithm; graph theory and algorithms; game theory and cryptography; scheduling algorithms and circuit complexity and CSoNet.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 35254 lei

Preț vechi: 44067 lei
-20% Nou

Puncte Express: 529

Preț estimativ în valută:
6746 7001$ 5639£

Carte tipărită la comandă

Livrare economică 15-29 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783319087825
ISBN-10: 3319087827
Pagini: 704
Ilustrații: XVI, 692 p. 126 illus.
Dimensiuni: 155 x 235 x 37 mm
Greutate: 0.97 kg
Ediția:2014
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Public țintă

Research

Cuprins

Sampling and Randomized Methods.- Logic, Algebra and Automata.- Database and Data Structures.- Parameterized Complexity and Algorithms.- Computational Complexity.-Computational Biology and Computational Geometry.- Approximation Algorithm.- Graph Theory and Algorithms.- Theory and Cryptography.- Scheduling Algorithms and Circuit Complexity.- CSoNet.