|
|
|
|
LEADER |
00000nam a22000005i 4500 |
001 |
978-3-319-42634-1 |
003 |
DE-He213 |
005 |
20230222184749.0 |
007 |
cr nn 008mamaa |
008 |
160719s2016 sz | s |||| 0|eng d |
020 |
|
|
|a 9783319426341
|9 978-3-319-42634-1
|
024 |
7 |
|
|a 10.1007/978-3-319-42634-1
|2 doi
|
050 |
|
4 |
|a QA76.9.A43
|
072 |
|
7 |
|a UMB
|2 bicssc
|
072 |
|
7 |
|a COM051300
|2 bisacsh
|
072 |
|
7 |
|a UMB
|2 thema
|
082 |
0 |
4 |
|a 518.1
|2 23
|
245 |
1 |
0 |
|a Computing and Combinatorics
|h [electronic resource] :
|b 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings /
|c edited by Thang N. Dinh, My T. Thai.
|
250 |
|
|
|a 1st ed. 2016.
|
264 |
|
1 |
|a Cham :
|b Springer International Publishing :
|b Imprint: Springer,
|c 2016.
|
300 |
|
|
|a XIII, 634 p. 98 illus.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 9797
|
505 |
0 |
|
|a 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.
|
520 |
|
|
|a 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.
|
650 |
|
0 |
|a Algorithms.
|
650 |
|
0 |
|a Computer science-Mathematics.
|
650 |
|
0 |
|a Discrete mathematics.
|
650 |
|
0 |
|a Computer science.
|
650 |
|
0 |
|a Artificial intelligence.
|
650 |
|
0 |
|a Computer networks .
|
650 |
|
0 |
|a Machine theory.
|
650 |
1 |
4 |
|a Algorithms.
|
650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
650 |
2 |
4 |
|a Theory of Computation.
|
650 |
2 |
4 |
|a Artificial Intelligence.
|
650 |
2 |
4 |
|a Computer Communication Networks.
|
650 |
2 |
4 |
|a Formal Languages and Automata Theory.
|
700 |
1 |
|
|a Dinh, Thang N.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
700 |
1 |
|
|a Thai, My T.
|e editor.
|0 (orcid)0000-0003-0503-2012
|1 https://orcid.org/0000-0003-0503-2012
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer Nature eBook
|
776 |
0 |
8 |
|i Printed edition:
|z 9783319426334
|
776 |
0 |
8 |
|i Printed edition:
|z 9783319426358
|
830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 9797
|
856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/978-3-319-42634-1
|z Texto Completo
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-SXCS
|
912 |
|
|
|a ZDB-2-LNC
|
950 |
|
|
|a Computer Science (SpringerNature-11645)
|
950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|