My Account Log in

1 option

Theory and Applications of Models of Computation : 17th Annual Conference, TAMC 2022, Tianjin, China, September 16–18, 2022, Proceedings / edited by Ding-Zhu Du, Donglei Du, Chenchen Wu, Dachuan Xu.

SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online

View online
Format:
Book
Contributor:
Du, Dingzhu, editor.
Series:
Lecture Notes in Computer Science, 1611-3349 ; 13571
Language:
English
Subjects (All):
Algorithms.
Numerical analysis.
Computer science--Mathematics.
Computer science.
Discrete mathematics.
Image processing--Digital techniques.
Image processing.
Computer vision.
Numerical Analysis.
Discrete Mathematics in Computer Science.
Mathematical Applications in Computer Science.
Theory of Computation.
Computer Imaging, Vision, Pattern Recognition and Graphics.
Local Subjects:
Algorithms.
Numerical Analysis.
Discrete Mathematics in Computer Science.
Mathematical Applications in Computer Science.
Theory of Computation.
Computer Imaging, Vision, Pattern Recognition and Graphics.
Physical Description:
1 online resource (427 pages)
Edition:
1st ed. 2022.
Place of Publication:
Cham : Springer International Publishing : Imprint: Springer, 2022.
Summary:
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.
Contents:
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. .
Other Format:
Print version: Du, Ding-Zhu Theory and Applications of Models of Computation
ISBN:
3-031-20350-X

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account