000 04716nam a22006015i 4500
001 978-3-031-43587-4
003 DE-He213
005 20240730201628.0
007 cr nn 008mamaa
008 230921s2023 sz | s |||| 0|eng d
020 _a9783031435874
_9978-3-031-43587-4
024 7 _a10.1007/978-3-031-43587-4
_2doi
050 4 _aQA9.58
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a005.13
_223
245 1 0 _aFundamentals of Computation Theory
_h[electronic resource] :
_b24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings /
_cedited by Henning Fernau, Klaus Jansen.
250 _a1st ed. 2023.
264 1 _aCham :
_bSpringer Nature Switzerland :
_bImprint: Springer,
_c2023.
300 _aXIII, 438 p. 111 illus., 46 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v14292
505 0 _aConvergence 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.
520 _aThis 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.
650 0 _aAlgorithms.
_93390
650 0 _aData structures (Computer science).
_98188
650 0 _aInformation theory.
_914256
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aImage processing
_xDigital techniques.
_94145
650 0 _aComputer vision.
_9168068
650 1 4 _aDesign and Analysis of Algorithms.
_931835
650 2 4 _aData Structures and Information Theory.
_931923
650 2 4 _aMathematics of Computing.
_931875
650 2 4 _aComputer Imaging, Vision, Pattern Recognition and Graphics.
_931569
700 1 _aFernau, Henning.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9168069
700 1 _aJansen, Klaus.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9168070
710 2 _aSpringerLink (Online service)
_9168071
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031435867
776 0 8 _iPrinted edition:
_z9783031435881
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v14292
_923263
856 4 0 _uhttps://doi.org/10.1007/978-3-031-43587-4
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c96631
_d96631