OPAC

検索結果一覧に戻る

Fundamentals of Computation Theory : 24th International Symposium, FCT 2023, Trier, Germany, September 18–21, 2023, Proceedings / edited by Henning Fernau, Klaus Jansen
(Lecture Notes in Computer Science. ISSN:16113349 ; 14292)

データ種別	電子ブック
版	1st ed. 2023.
出版者	(Cham : Springer Nature Switzerland : Imprint: Springer)
出版年	2023
大きさ	XIII, 438 p. 111 illus., 46 illus. in color : online resource
著者標目	Fernau, Henning editor Jansen, Klaus editor SpringerLink (Online service)

所蔵情報を非表示

URL	巻　次	配架場所	請求記号	登録番号	コメント	刷　年	状　態	利用注記	ISBN	予約	請求メモ
URL		射水-電子	007	EB0004794	Computer Scinece R0 2005-6,2022-3				9783031435874

書誌詳細を非表示

一般注記	Convergence of distributions on paths -- Subtree Projection for Stepwise Hedge Automata -- The rectilinear convex hull of line segments -- Domino Snake Problems on Groups -- Parsing Unranked Tree Languages, Folded Once -- The Impact of State Merging on Predictive Accuracy in Probabilistic Tree Automata: Dietze's Conjecture Revisited -- Computing Subset Vertex Covers in H-Free Graphs -- On Computing Optimal Temporal Branchings -- Contracting edges to destroy a pattern: A complexity study -- Distance-based covering problems for graphs of given cyclomatic number -- An efficient computation of the rank function of a positroid -- Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time -- Complexity of Conformant Election Manipulation -- α-β-Factorization and the Binary Case of Simon’s Congruence -- Bounds for c-Ideal Hashing -- Parameterized Complexity of $\mathcal{T}_{h+1}$-Free Edge Deletion Problem -- On the Parallel Complexity of Group Isomorphism via Weisfeiler--Leman -- The Complexity of $(P_k, P_\ell)$-Arrowing -- On Computing a Center Persistence Diagram -- Robust Identification in the Limit from Incomplete Positive Data -- Cordial Forests -- Vertex ordering with precedence constraints -- Forwards- and Backwards-Reachability for Cooperating Multi-Pushdown Systems -- Shortest Dominating Set Reconfiguration under Token Sliding -- Computing Optimal Leaf Roots of Chordal Cographs in Linear Time -- Verified Exact Real Computation with Nondeterministic Functions and Limits -- Exact and Parameterized Algorithms for the Independent Cutset Problem -- Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves -- Two UNO Decks Efficiently Perform Zero-Knowledge Proof for Sudoku -- Power of Counting by Nonuniform Families of Polynomial-Size Finite Automata This book constitutes the proceedings of the 24th International Symposium on Fundamentals of Computation Theory, FCT 2023, held in Trier, Germany, in September 2023. The __ full papers included in this volume were carefully reviewed and selected from __ submissions. In addition, the book contains ____ invited talks. The papers cover topics of all aspects of theoretical computer science, in particular algorithms, complexity, formal and logical methods HTTP:URL=https://doi.org/10.1007/978-3-031-43587-4
件　名	LCSH:Algorithms LCSH:Data structures (Computer science) LCSH:Information theory LCSH:Computer science -- Mathematics 全ての件名で検索 LCSH:Image processing -- Digital techniques 全ての件名で検索 LCSH:Computer vision FREE:Design and Analysis of Algorithms FREE:Data Structures and Information Theory FREE:Mathematics of Computing FREE:Computer Imaging, Vision, Pattern Recognition and Graphics
分　類	LCC:QA9.58 DC23:005.13
書誌ID	EB00004182
ISBN	9783031435874