Cantitate/Preț
Produs
Total produse
Vezi coșul
Fundamentals of Computation Theory: 24th International Symposium, FCT 2023, Trier, Germany, September 18–21, 2023, Proceedings de Henning Fernau

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 Jansen
en Limba Engleză Paperback – 22 sep 2023
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 52033 lei

Preț vechi: 65042 lei
-20% Nou

Puncte Express: 780
Preț estimativ în valută:
9206€ • 10741$ • 8049£

Carte tipărită la comandă

Livrare economică 16-30 ianuarie 26

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
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

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.