LEADER 00900nam0-22003131i-450- 001 990004234410403321 005 20090721131609.0 035 $a000423441 035 $aFED01000423441 035 $a(Aleph)000423441FED01 035 $a000423441 100 $a19990604d1977----km-y0itay50------ba 101 0 $aita 105 $ay-------001yy 200 1 $a<>domenica di Bouvines$e27 luglio 1214$fGeorges Duby 210 $aTorino$cEinaudi$dc1977 215 $a240 p., [5] c. di tav.$cill.$d22 cm 225 1 $aSaggi$v581 610 0 $aFrancia$aBattaglia di Bouvines. 1214 676 $a944.023 700 1$aDuby,$bGeorges$f<1919-1996>$011158 801 0$aIT$bUNINA$gRICA$2UNIMARC 901 $aBK 912 $a990004234410403321 952 $a944.023 DUB 1$fFLFBC 952 $aCOLL.56(581)$bDip.f.m.1317$fFLFBC 959 $aFLFBC 996 $aDomenica di Bouvines$993477 997 $aUNINA LEADER 04822nam 22006975 450 001 9910746297303321 005 20250808074701.0 010 $a3-031-43587-7 024 7 $a10.1007/978-3-031-43587-4 035 $a(MiAaPQ)EBC30750415 035 $a(Au-PeEL)EBL30750415 035 $a(OCoLC)1399170379 035 $a(DE-He213)978-3-031-43587-4 035 $a(CKB)28275621900041 035 $a(EXLCZ)9928275621900041 100 $a20230921d2023 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aFundamentals of Computation Theory $e24th International Symposium, FCT 2023, Trier, Germany, September 18?21, 2023, Proceedings /$fedited by Henning Fernau, Klaus Jansen 205 $a1st ed. 2023. 210 1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2023. 215 $a1 online resource (450 pages) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v14292 311 08$aPrint version: Fernau, Henning Fundamentals of Computation Theory Cham : Springer,c2023 9783031435867 320 $aIncludes bibliographical references and index. 327 $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. 330 $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 30 full papers included in this volume were carefully reviewed and selected from 79 submissions. The papers cover topics of all aspects of theoretical computer science, in particular Fundamentals of Computation Theory, Approximation Algorithms, Computable Analysis and much more. 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v14292 606 $aAlgorithms 606 $aData structures (Computer science) 606 $aInformation theory 606 $aComputer science$xMathematics 606 $aImage processing$xDigital techniques 606 $aComputer vision 606 $aDesign and Analysis of Algorithms 606 $aData Structures and Information Theory 606 $aMathematics of Computing 606 $aComputer Imaging, Vision, Pattern Recognition and Graphics 615 0$aAlgorithms. 615 0$aData structures (Computer science) 615 0$aInformation theory. 615 0$aComputer science$xMathematics. 615 0$aImage processing$xDigital techniques. 615 0$aComputer vision. 615 14$aDesign and Analysis of Algorithms. 615 24$aData Structures and Information Theory. 615 24$aMathematics of Computing. 615 24$aComputer Imaging, Vision, Pattern Recognition and Graphics. 676 $a004 702 $aFernau$b Henning 702 $aJansen$b Klaus 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910746297303321 996 $aFundamentals of Computation Theory$92557870 997 $aUNINA