000 04664nam a22006495i 4500
001 978-3-030-25027-0
003 DE-He213
005 20240730174051.0
007 cr nn 008mamaa
008 190709s2019 sz | s |||| 0|eng d
020 _a9783030250270
_9978-3-030-25027-0
024 7 _a10.1007/978-3-030-25027-0
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
072 7 _aUMB
_2thema
082 0 4 _a518.1
_223
245 1 0 _aFundamentals of Computation Theory
_h[electronic resource] :
_b22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings /
_cedited by Leszek Antoni Gąsieniec, Jesper Jansson, Christos Levcopoulos.
250 _a1st ed. 2019.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2019.
300 _aXIII, 365 p. 266 illus., 27 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 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v11651
505 0 _aInvited 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.
520 _aThis 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.
650 0 _aAlgorithms.
_93390
650 0 _aComputer graphics.
_94088
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aArtificial intelligence.
_93407
650 0 _aArtificial intelligence
_xData processing.
_921787
650 0 _aComputer networks .
_931572
650 1 4 _aAlgorithms.
_93390
650 2 4 _aComputer Graphics.
_94088
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aArtificial Intelligence.
_93407
650 2 4 _aData Science.
_934092
650 2 4 _aComputer Communication Networks.
_9110939
700 1 _aGąsieniec, Leszek Antoni.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9110940
700 1 _aJansson, Jesper.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9110941
700 1 _aLevcopoulos, Christos.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9110942
710 2 _aSpringerLink (Online service)
_9110943
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030250263
776 0 8 _iPrinted edition:
_z9783030250287
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v11651
_9110944
856 4 0 _uhttps://doi.org/10.1007/978-3-030-25027-0
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c89240
_d89240