國立虎尾科技大學 |

Theory and Applications of Models of Computation = 16th International Conference, TAMC 2020, Changsha, China, October 18–20, 2020, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Theory and Applications of Models of Computation/ edited by Jianer Chen, Qilong Feng, Jinhui Xu.
其他題名:	16th International Conference, TAMC 2020, Changsha, China, October 18–20, 2020, Proceedings /
其他作者:	Xu, Jinhui.
面頁冊數:	XI, 454 p. 240 illus., 33 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Data Structures. -
電子資源:	https://doi.org/10.1007/978-3-030-59267-7
ISBN:	9783030592677

Theory and Applications of Models of Computation = 16th International Conference, TAMC 2020, Changsha, China, October 18–20, 2020, Proceedings /
Theory and Applications of Models of Computation16th International Conference, TAMC 2020, Changsha, China, October 18–20, 2020, Proceedings /[electronic resource] :edited by Jianer Chen, Qilong Feng, Jinhui Xu. - 1st ed. 2020. - XI, 454 p. 240 illus., 33 illus. in color.online resource. - Theoretical Computer Science and General Issues ;12337. - Theoretical Computer Science and General Issues ;9163.

Semilattices of punctual numberings -- Partial Sums on the Ultra-Wide Word RAM -- Securely Computing the $n$-Variable Equality Function with $2n$ Cards 24 -- Polynomial Kernels for Paw-free Edge Modi cation Problems -- Floorplans with Walls -- A Primal-Dual Randomized Algorithm for the Online Weighted Set Multi-Cover Problem -- Sumcheck-Based Delegation of Quantum Computing to Rational Server -- Online Removable Knapsack Problems for Integer-Sized Items -- An Improved Approximation Algorithm for the Prize-Collecting Red-Blue Median Problem -- LP-based Algorithms for Computing Maximum Vertex-Disjoint Paths with Different Colors -- A Constant Factor Approximation for Lower-Bounded $k$-Median -- Reverse Mathematics, Projective Modules and Invertible Modules -- Two-Stage Submodular Maximization Problem Beyond Non-Negative and Monotone -- Optimal Matroid Bases with Intersection Constraints: Valuated Matroids, M-convex Functions, and Their Applications -- On the complexity of acyclic modules in automata networks.-Eternal Connected Vertex Cover Problem -- Parametric Streaming Two-Stage Submodular Maximization -- Approximation Guarantees for Deterministic Maximization of Submodular Function with a Matroid Constraint -- A Novel Initialization Algorithm for Fuzzy C-means Problems -- On the Parameterized Complexity of $d$-Restricted Boolean Net Synthesis -- Approximate #Knapsack Computations to Count Semi-Fair Allocations -- Characterizations and approximability of hard counting classes below #P -- On Existence of Equilibrium Under Social Coalition Structures -- Space Complexity of Streaming Algorithms on Universal Quantum Computers -- On Coresets for Support Vector Machines -- Tractabilities for Tree Assembly Problems -- On Characterization of Petrie Partitionable Plane Graphs -- Disjunctive Propositional Logic and Scott Domains -- Dispersing and Grouping Points on Segments in the Plane -- Synchronizing Words and Monoid Factorization: A Parameterized Perspective -- Hidden Community Detection on Two-layer Stochastic Models: a Theoretical Perspective -- A Primal-Dual Algorithm for Euclidean $k$-Means problem with Penalties -- The Complexity of the Partition Coloring Problem -- FPT Algorithms for Generalized Feedback Vertex Set Problems -- Fixed-order Book Thickness with Respect to Vertex-cover Number: New Observations and Further Analysis -- Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles -- On Pure Space vs Catalytic Space.

This book constitutes the refereed proceedings of the 16th Annual Conference on Theory and Applications of Models of Computation, TAMC 2020, held in Changsha, China, in October 2020. The 37 full papers were carefully reviewed and selected from 83 submissions. The main themes of the selected papers are computability, complexity, algorithms, information theory and their extensions to machine learning theory and foundations of artificial intelligence.

ISBN: 9783030592677

Standard No.: 10.1007/978-3-030-59267-7doiSubjects--Topical Terms:

669824
Data Structures.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Theory and Applications of Models of Computation = 16th International Conference, TAMC 2020, Changsha, China, October 18–20, 2020, Proceedings /
LDR:04462nam a22004095i 4500 001 1030391
003 DE-He213
005 20201012063938.0
007 cr nn 008mamaa
008 210318s2020 gw | s |||| 0|eng d
020 $a 9783030592677 $9 978-3-030-59267-7
024 7 $a 10.1007/978-3-030-59267-7 $2 doi
035 $a 978-3-030-59267-7
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 Theory and Applications of Models of Computation $h [electronic resource] : $b 16th International Conference, TAMC 2020, Changsha, China, October 18–20, 2020, Proceedings / $c edited by Jianer Chen, Qilong Feng, Jinhui Xu.
250 $a 1st ed. 2020.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a XI, 454 p. 240 illus., 33 illus. in color. $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 12337
505 0 $a Semilattices of punctual numberings -- Partial Sums on the Ultra-Wide Word RAM -- Securely Computing the $n$-Variable Equality Function with $2n$ Cards 24 -- Polynomial Kernels for Paw-free Edge Modi cation Problems -- Floorplans with Walls -- A Primal-Dual Randomized Algorithm for the Online Weighted Set Multi-Cover Problem -- Sumcheck-Based Delegation of Quantum Computing to Rational Server -- Online Removable Knapsack Problems for Integer-Sized Items -- An Improved Approximation Algorithm for the Prize-Collecting Red-Blue Median Problem -- LP-based Algorithms for Computing Maximum Vertex-Disjoint Paths with Different Colors -- A Constant Factor Approximation for Lower-Bounded $k$-Median -- Reverse Mathematics, Projective Modules and Invertible Modules -- Two-Stage Submodular Maximization Problem Beyond Non-Negative and Monotone -- Optimal Matroid Bases with Intersection Constraints: Valuated Matroids, M-convex Functions, and Their Applications -- On the complexity of acyclic modules in automata networks.-Eternal Connected Vertex Cover Problem -- Parametric Streaming Two-Stage Submodular Maximization -- Approximation Guarantees for Deterministic Maximization of Submodular Function with a Matroid Constraint -- A Novel Initialization Algorithm for Fuzzy C-means Problems -- On the Parameterized Complexity of $d$-Restricted Boolean Net Synthesis -- Approximate #Knapsack Computations to Count Semi-Fair Allocations -- Characterizations and approximability of hard counting classes below #P -- On Existence of Equilibrium Under Social Coalition Structures -- Space Complexity of Streaming Algorithms on Universal Quantum Computers -- On Coresets for Support Vector Machines -- Tractabilities for Tree Assembly Problems -- On Characterization of Petrie Partitionable Plane Graphs -- Disjunctive Propositional Logic and Scott Domains -- Dispersing and Grouping Points on Segments in the Plane -- Synchronizing Words and Monoid Factorization: A Parameterized Perspective -- Hidden Community Detection on Two-layer Stochastic Models: a Theoretical Perspective -- A Primal-Dual Algorithm for Euclidean $k$-Means problem with Penalties -- The Complexity of the Partition Coloring Problem -- FPT Algorithms for Generalized Feedback Vertex Set Problems -- Fixed-order Book Thickness with Respect to Vertex-cover Number: New Observations and Further Analysis -- Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles -- On Pure Space vs Catalytic Space.
520 $a This book constitutes the refereed proceedings of the 16th Annual Conference on Theory and Applications of Models of Computation, TAMC 2020, held in Changsha, China, in October 2020. The 37 full papers were carefully reviewed and selected from 83 submissions. The main themes of the selected papers are computability, complexity, algorithms, information theory and their extensions to machine learning theory and foundations of artificial intelligence.
650 2 4 $a Data Structures. $3 669824
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Numeric Computing. $3 669943
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Numerical analysis. $3 527939
650 0 $a Algorithms. $3 527865
700 1 $a Xu, Jinhui. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 680941
700 1 $a Feng, Qilong. $e editor. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1327300
700 1 $a Chen, Jianer. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 785765
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030592660
776 0 8 $i Printed edition: $z 9783030592684
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-030-59267-7
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)