Theory and Applications of Models of Computation : 18th Annual Conference, TAMC 2024, Hong Kong, China, May 13-15, 2024, Proceedings (Lecture Notes in Computer Science)

個数：

Theory and Applications of Models of Computation : 18th Annual Conference, TAMC 2024, Hong Kong, China, May 13-15, 2024, Proceedings (Lecture Notes in Computer Science)

Chen, Xujin (EDT)/ Li, Bo (EDT)

ウェブストア価格 ¥51,037（本体¥46,398）
Springer Nature（2024/05発売）
外貨定価 US$ 249.99
ポイント 463pt

提携先の海外書籍取次会社に在庫がございます。通常3週間で発送いたします。
【重要ご説明事項】
1. 納期遅延や、ご入手不能となる場合が若干ございます。
2. 複数冊ご注文の場合、分割発送となる場合がございます。
3. 美品のご指定は承りかねます。

●3Dセキュア導入とクレジットカードによるお支払いについて

【入荷遅延について】
世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。

◆画像の表紙や帯等は実物とは異なる場合があります。

◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
また、洋書販売価格は、ご注文確定時点での日本円価格となります。
ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。

製本 Paperback:紙装版/ペーパーバック版／ページ数 368 p.
言語 ENG
商品コード 9789819723393

Full Description

This book constitutes the proceedings of the 18th Annual Conference on Theory and Applications of Models of Computation, TAMC 2024, which was held in Hong Kong, China, during May 13-15, 2024.

The 30 full papers presented in this book were carefully reviewed and selected from 69 submissions. The main themes of the selected papers are computability, complexity, algorithms, information theory, as well as their integration with machine learning theory and the foundations of artificial intelligence.

.- On Learning Families of Ideals in Lattices and Boolean Algebras.

.- Unambiguous and Co-Nondeterministic Computations of Finite Automata and Pushdown Automata Families and the Effects of Multiple Counters

.- A Gray Code of Ordered Trees

.- Mechanism Design with Predictions for Facility Location Games with Candidate Locations

.- An Improved Approximation Algorithm for Metric Triangle Packing

.- An Optimal and Practical Algorithm for the Planar 2-Center Problem

.- Endogenous Threshold Selection with Two-Interval Restricted Tests

.- An Improved Kernel and Parameterized Algorithm for Almost Induced Matching

.- A Tight Threshold Bound for Search Trees with 2-Way Comparisons

.- Kleene Theorems for Lasso and ω-Languages

.- Tight Double Exponential Lower Bounds

.- Source-Oblivious Broadcast

.- On the 3-Tree Core of Plane Graphs

.- A Coq-Based Infrastructure for Quantum Programming, Verification and Simulation

.- A Local Search Algorithm for Radius-Constrained $k$-Median

.- Energy and Output Patterns in Boolean Circuits

.- Approximation Algorithms for Robust Clustering Problems Using Local Search Techniques

.- On the Power of Counting the Total Number of Computation Paths of NPTMs

.- The Parameterized Complexity of Maximum Betweenness Centrality

.- Offensive Alliances in Signed Graphs

.- Quantum Path Parallelism: A Circuit-Based Approach to Text Searching

.- Space-Efficient Graph Kernelizations

.- Counting on Rainbow $k$-Connections

.- Some Combinatorial Algorithms on the Edge Cover Number of $k$-Regular Connected Hypergraphs

.- Time Efficient Implementation for Online $k$-Server Problem on Trees

.- Improved Approximation Algorithm for the Distributed Lower-Bounded k-Center Problem

.- Parameterized Complexity of Weighted Target Set Selection

.- Mechanism Design for Building Optimal Bridges between Regions

.- Joint Bidding in Ad Auctions

.- Lower Bounds for the Sum of Small-Size Algebraic Branching Programs.