000945429 000__ 04788cam\a2200505Mi\4500
000945429 001__ 945429
000945429 005__ 20230306152521.0
000945429 006__ m\\\\\o\\d\\\\\\\\
000945429 007__ cr\nn\nnnunnun
000945429 008__ 201011s2020\\\\gw\\\\\\o\\\\\|||\0\eng\d
000945429 019__ $$a1200495462
000945429 020__ $$a3030592677
000945429 020__ $$a9783030592677
000945429 020__ $$z3030592669
000945429 020__ $$z9783030592660
000945429 0247_ $$a10.1007/978-3-030-59267-7$$2doi
000945429 035__ $$aSP(OCoLC)on1204152603
000945429 035__ $$aSP(OCoLC)1204152603$$z(OCoLC)1200495462
000945429 040__ $$aSFB$$beng$$cSFB$$dOCLCO$$dYDX
000945429 049__ $$aISEA
000945429 050_4 $$aQA76.9.A43
000945429 08204 $$a005.1$$223
000945429 24500 $$aTheory and Applications of Models of Computation :$$b16th International Conference, TAMC 2020, Changsha, China, October 18-20, 2020, Proceedings /$$cedited by Jianer Chen, Qilong Feng, Jinhui Xu.
000945429 250__ $$a1st ed. 2020.
000945429 264_1 $$aCham :$$bSpringer International Publishing :$$bImprint: Springer,$$c2020.
000945429 300__ $$a1 online resource (XI, 454 pages) :$$billustrations.
000945429 336__ $$atext$$btxt$$2rdacontent
000945429 337__ $$acomputer$$bc$$2rdamedia
000945429 338__ $$aonline resource$$bcr$$2rdacarrier
000945429 4901_ $$aTheoretical Computer Science and General Issues ;$$v12337
000945429 5050_ $$aSemilattices 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.
000945429 506__ $$aAccess limited to authorized users.
000945429 520__ $$aThis 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.
000945429 650_0 $$aAlgorithms.
000945429 650_0 $$aNumerical analysis.
000945429 650_0 $$aComputer science$$xMathematics.
000945429 650_0 $$aData structures (Computer science)
000945429 7001_ $$aChen, Jianer.$$eeditor.
000945429 7001_ $$aFeng, Qilong.$$eeditor.
000945429 7001_ $$aXu, Jinhui.$$eeditor.
000945429 830_0 $$aLNCS sublibrary.$$nSL 1,$$pTheoretical computer science and general issues ;$$v12337.
000945429 852__ $$bebk
000945429 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-030-59267-7$$zOnline Access$$91397441.1
000945429 909CO $$ooai:library.usi.edu:945429$$pGLOBAL_SET
000945429 980__ $$aEBOOK
000945429 980__ $$aBIB
000945429 982__ $$aEbook
000945429 983__ $$aOnline
000945429 994__ $$a92$$bISE