Cantitate/Preț
Produs
Total produse
Vezi coșul
Fundamentals of Computation Theory: 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings de Leszek Antoni Gąsieniec

Fundamentals of Computation Theory: 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings: Lecture Notes in Computer Science, cartea 11651

Editat de Leszek Antoni Gąsieniec, Jesper Jansson, Christos Levcopoulos
en Limba Engleză Paperback – 10 iul 2019
This book constitutes the proceedings of the 22nd International Symposium on Fundamentals of Computation Theory, FCT 2019, held in Copenhagen, Denmark, in August 2019. The 21 full papers included in this volume were carefully reviewed and selected from 45 submissions. In addition, the book contains 3 invited talks in full-paper length. The papers were organized in topical sections named: formal methods, complexity, and algorithms.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33667 lei

Preț vechi: 42084 lei
-20% Nou

Puncte Express: 505
Preț estimativ în valută:
6443€ • 6686$ • 5385£

Carte tipărită la comandă

Livrare economică 17-31 martie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030250263
ISBN-10: 3030250261
Pagini: 354
Ilustrații: XIII, 365 p. 267 illus., 27 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.54 kg
Ediția:1st ed. 2019
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Cuprins

Invited papers.- Algebraic Theory of Promise Constraint Satisfaction Problems, First Steps.- Some Observations on Dynamic Random Walks and Network Renormalization.- Highly Succinct Dynamic Data Structures.- Formal methods.- Largest Common Prefix of a Regular Tree Language.- Winning Strategies for Streaming Rewriting Games.- Nominal Syntax with Atom Substitutions: Matching, Unification, Rewriting.- Two characterizations of finite-state dimension.- Complexity.- Optimal channel utilization with limited feedback.- Deterministic Preparation of Dicke States.- Complete Disjoint coNP-Pairs but no Complete Total Polynomial Search Problems Relative to an Oracle.- On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties.- Algorithms.- An Efficient Algorithm for the Fast Delivery Problem.- Extension of some edge graph problems: standard and parameterized complexity.- Space Efficient Algorithms for Breadth-Depth Search.- Circular Pattern Matching with k Mismatches.- SuccinctRepresentations of Finite Groups.- On the Tractability of Covering a Graph with 2-Clubs.- On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest.- Maximum rectilinear convex subsets.- Computing Digraph Width Measures on Directed Co-Graphs.- Fault-tolerant parallel scheduling of arbitrary length jobs on a shared channel.- Rare Siblings Speed-up Deterministic Detection and Counting of Small Pattern Graphs.- Bivariate B-splines from convex pseudo-circle configurations.- The Fault-Tolerant Metric Dimension of Cographs.