Theory and Applications of Models of Computation

17th Annual Conference, TAMC 2022, Tianjin, China, September 16–18, 2022, Proceedings

AvDing-Zhu Du,Donglei Du

Häftad, Engelska, 2023

Del 13571 i serien Lecture Notes in Computer Science

865 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

This book constitutes the refereed proceedings of the 17th Annual Conference on Theory and Applications of Models of Computation, TAMC 2022, held as a virtual event, in September 2022.The 33 full papers were carefully reviewed and selected from 75 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.

Produktinformation

Utgivningsdatum:2023-01-02
Mått:155 x 235 x 24 mm
Vikt:651 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:416
Förlag:Springer International Publishing AG
ISBN:9783031203497

Utforska kategorier

Innehållsförteckning

Maximization of $k$-Submodular Function with a Matroid Constraint.- Maximizing Approximately Non-$k$-Submodular Monotone Set Function with Matroid Constraint.- Time-of-Use Scheduling Problem With Equal-Length Jobs.- Online Non-Submodular and Non-Convex Optimization with Stochastic Long-Term Constraints.- Physical ZKP for Makaro Using a Standard Deck of Cards.- Characterization of the Imbalance Problem on Complete Bipartite Graphs.- New Algorithms for a Simple Measure of Network Partitioning.- On Two Types of Concept Lattices in the Theory of Numberings.- Computing Connected-$k$-Subgraph Cover with Connectivity Requirement.- Analyzing the $3$-Path Vertex Cover Problem in Planar Bipartite Graphs.- Competition-Based Generalized Self-profit Maximization in Dual-Attribute Networks.- Largest Convex Hull for Constant Size, Convex-Hull Disjoint Clusters.- Two-Stage Submodular Maximization Under Knapsack Problem.- (Z, succ, U), (Z, E, U), and their CSP's.- Circle Graph Isomorphism in Almost Linear Time.- The Exact Subset MultiCover Problem.- Hide a Liar: Card-Based ZKP Protocol for Usowan.- Complexity Analysis of a Stochastic Variant of Generalized Alternating Direction Method of Multipliers.- A 3/4 Differential Approximation Algorithm for Traveling Salesman Problem.- Exact and Parameterized Algorithms for Restricted Subset Feedback Vertex Set in Chordal Graphs.- An Approximation Algorithm for the B-prize-collecting Multicut Problem in Trees.- Two-Stage Non-Submodular Maximization.- Fault-Tolerant Total Domination via Submodular Function Approximation.- On the Parallel Complexity of Constrained Read-Once Refutations in UTVPI Constraint Systems.- Extracting Densest Sub-Hypergraph with Convex Edge-Weight Functions.- Exact and Approximation Algorithms for PMMS Under Identical Constraints.- Finite-State Relative Dimension, Dimensions of AP Subsequences and a Finite-State van Lambalgen's Theorem.- Distributed Connected Dominating Sets in Unit Square andDisk Graphs.- An Inventory System Optimization for Solving Joint Pricing and Ordering Problem with Trapezoidal Demand and Partial Backlogged Shortages in a Limited Sales Period.- A Set-Theoretic Representation of Algebraic L-Domains.- Normality, Randomness and Kolmogorov Complexity of Continued Fractions.- Weakly $k$-Submodular Maximization Under Matroid Constraint.- Approximation Algorithms for Diversity-Bounded Center Problems.