國立虎尾科技大學 |

Computing and Combinatorics = 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Computing and Combinatorics / edited by Thang N. Dinh, My T. Thai.
其他題名:	22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings /
其他作者:	Dinh, Thang N.
面頁冊數:	XIII, 634 p. 98 illus.online resource. :
Contained By:	Springer Nature eBook
標題:	Algorithms. -
電子資源:	https://doi.org/10.1007/978-3-319-42634-1
ISBN:	9783319426341

Computing and Combinatorics = 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings /
Computing and Combinatorics 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings /[electronic resource] :edited by Thang N. Dinh, My T. Thai. - 1st ed. 2016. - XIII, 634 p. 98 illus.online resource. - Theoretical Computer Science and General Issues ;9797. - Theoretical Computer Science and General Issues ;9163.

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.

ISBN: 9783319426341

Standard No.: 10.1007/978-3-319-42634-1doiSubjects--Topical Terms:

527865
Algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Computing and Combinatorics = 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings /
LDR:02563nam a22004095i 4500 001 981002
003 DE-He213
005 20200705123717.0
007 cr nn 008mamaa
008 201211s2016 gw | 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
035 $a 978-3-319-42634-1
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 005.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 ; $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. $3 527865
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Computers. $3 565115
650 0 $a Artificial intelligence. $3 559380
650 0 $a Computer communication systems. $3 1115394
650 0 $a Mathematical logic. $2 bicssc $3 810627
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Computation by Abstract Devices. $3 669792
650 2 4 $a Artificial Intelligence. $3 646849
650 2 4 $a Computer Communication Networks. $3 669310
650 2 4 $a Mathematical Logic and Formal Languages. $3 670059
700 1 $a Dinh, Thang N. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1111309
700 1 $a Thai, My T. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 678791
710 2 $a SpringerLink (Online service) $3 593884
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 ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-319-42634-1
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)