000913438 000__ 04480cam\a2200625Ii\4500
000913438 001__ 913438
000913438 005__ 20230306150331.0
000913438 006__ m\\\\\o\\d\\\\\\\\
000913438 007__ cr\cn\nnnunnun
000913438 008__ 190829s2019\\\\sz\a\\\\ob\\\\101\0\eng\d
000913438 019__ $$a1115115489$$a1119127602
000913438 020__ $$a9783030250270$$q(electronic book)
000913438 020__ $$a303025027X$$q(electronic book)
000913438 020__ $$z9783030250263
000913438 020__ $$a3030250261
000913438 020__ $$a9783030250263
000913438 020__ $$a9783030250287
000913438 020__ $$a3030250288
000913438 0247_ $$a10.1007/978-3-030-25027-0$$2doi
000913438 035__ $$aSP(OCoLC)on1114336651
000913438 035__ $$aSP(OCoLC)1114336651$$z(OCoLC)1115115489$$z(OCoLC)1119127602
000913438 040__ $$aGW5XE$$beng$$erda$$epn$$cGW5XE$$dVT2$$dUPM$$dUAB$$dUKMGB
000913438 049__ $$aISEA
000913438 050_4 $$aQA75.5$$b.F38 2019eb
000913438 08204 $$a004$$223
000913438 1112_ $$aFCT (Symposium)$$n(22nd :$$d2019 :$$cCopenhagen, Denmark)
000913438 24510 $$aFundamentals of computation theory :$$b22nd International Symposium, FCT 2019, Copenhagen, Demark, August 12-14, 2019, Proceedings /$$cLeszek Antoni Gąsieniec, Jesper Jansson, Christos Levcopoulos (eds.).
000913438 24630 $$aFCT 2019
000913438 264_1 $$aCham :$$bSpringer,$$c[2019]
000913438 264_4 $$c©2019
000913438 300__ $$a1 online resource :$$billustrations.
000913438 336__ $$atext$$btxt$$2rdacontent
000913438 337__ $$acomputer$$bc$$2rdamedia
000913438 338__ $$aonline resource$$bcr$$2rdacarrier
000913438 347__ $$atext file$$bPDF$$2rda
000913438 4901_ $$aLecture notes in computer science,$$x0302-9743 ;$$v11651
000913438 4901_ $$aLNCS Sublibrary: SL1 - Theoretical computer science and general issues
000913438 504__ $$aIncludes bibliographical references and index.
000913438 5050_ $$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 -- Succinct Representations 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.
000913438 506__ $$aAccess limited to authorized users.
000913438 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.
000913438 588__ $$aOnline resource; title from PDF title page (SpringerLink, viewed August 29, 2019).
000913438 650_0 $$aComputer science$$vCongresses.
000913438 650_0 $$aComputer science$$xMathematics$$vCongresses.
000913438 655_7 $$aConference papers and proceedings.$$2lcgft
000913438 7001_ $$aGąsieniec, Leszek,$$eeditor.
000913438 7001_ $$aJansson, Jesper,$$eeditor.
000913438 7001_ $$aLevcopoulos, Christos,$$eeditor.
000913438 77608 $$iPrint version:$$z9783030250263
000913438 830_0 $$aLecture notes in computer science ;$$v11651.
000913438 830_0 $$aLNCS sublibrary.$$nSL 1,$$pTheoretical computer science and general issues.
000913438 852__ $$bebk
000913438 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-030-25027-0$$zOnline Access$$91397441.1
000913438 909CO $$ooai:library.usi.edu:913438$$pGLOBAL_SET
000913438 980__ $$aEBOOK
000913438 980__ $$aBIB
000913438 982__ $$aEbook
000913438 983__ $$aOnline
000913438 994__ $$a92$$bISE