Fundamentals of Computation Theory: 24th International Symposium, FCT 2023, Trier, Germany, September 18–21, 2023, Proceedings: Lecture Notes in Computer Science, cartea 14292
Editat de Henning Fernau, Klaus Jansenen Limba Engleză Paperback – 22 sep 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.
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 340.32 lei
- 20% Preț: 341.95 lei
- 20% Preț: 453.32 lei
- 20% Preț: 238.01 lei
- 20% Preț: 340.32 lei
- 20% Preț: 438.69 lei
- Preț: 449.57 lei
- 20% Preț: 343.62 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 645.28 lei
- 17% Preț: 427.22 lei
- 20% Preț: 655.02 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 591.51 lei
- Preț: 381.21 lei
- 20% Preț: 337.00 lei
- 15% Preț: 438.59 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 575.48 lei
- 20% Preț: 583.40 lei
- 20% Preț: 763.23 lei
- 15% Preț: 580.46 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 353.50 lei
- 20% Preț: 585.88 lei
- Preț: 410.88 lei
- 20% Preț: 596.46 lei
- 20% Preț: 763.23 lei
- 20% Preț: 825.93 lei
- 20% Preț: 649.49 lei
- 20% Preț: 350.21 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 484.26 lei
Preț vechi: 605.33 lei
-20% Nou
Puncte Express: 726
Preț estimativ în valută:
92.68€ • 96.50$ • 78.32£
92.68€ • 96.50$ • 78.32£
Carte tipărită la comandă
Livrare economică 11-25 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783031435867
ISBN-10: 3031435869
Ilustrații: XIII, 438 p. 111 illus., 46 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.68 kg
Ediția:1st ed. 2023
Editura: Springer Nature Switzerland
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
ISBN-10: 3031435869
Ilustrații: XIII, 438 p. 111 illus., 46 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.68 kg
Ediția:1st ed. 2023
Editura: Springer Nature Switzerland
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
Cuprins
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.