國立虎尾科技大學 |

Fundamentals of Computation Theory = 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Fundamentals of Computation Theory/ edited by Leszek Antoni Gąsieniec, Jesper Jansson, Christos Levcopoulos.
其他題名:	22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings /
其他作者:	Gąsieniec, Leszek Antoni.
面頁冊數:	XIII, 365 p. 266 illus., 27 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Algorithms. -
電子資源:	https://doi.org/10.1007/978-3-030-25027-0
ISBN:	9783030250270

Fundamentals of Computation Theory = 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings /
Fundamentals of Computation Theory22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings /[electronic resource] :edited by Leszek Antoni Gąsieniec, Jesper Jansson, Christos Levcopoulos. - 1st ed. 2019. - XIII, 365 p. 266 illus., 27 illus. in color.online resource. - Theoretical Computer Science and General Issues ;11651. - Theoretical Computer Science and General Issues ;9163.

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 -- 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.

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.

ISBN: 9783030250270

Standard No.: 10.1007/978-3-030-25027-0doiSubjects--Topical Terms:

527865
Algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Fundamentals of Computation Theory = 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings /
LDR:03541nam a22004095i 4500 001 1014770
003 DE-He213
005 20200629202822.0
007 cr nn 008mamaa
008 210106s2019 gw | s |||| 0|eng d
020 $a 9783030250270 $9 978-3-030-25027-0
024 7 $a 10.1007/978-3-030-25027-0 $2 doi
035 $a 978-3-030-25027-0
050 4 $a QA76.9.A43
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 005.1 $2 23
245 1 0 $a Fundamentals of Computation Theory $h [electronic resource] : $b 22nd International Symposium, FCT 2019, Copenhagen, Denmark, August 12-14, 2019, Proceedings / $c edited by Leszek Antoni Gąsieniec, Jesper Jansson, Christos Levcopoulos.
250 $a 1st ed. 2019.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a XIII, 365 p. 266 illus., 27 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues ; $v 11651
505 0 $a 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 -- 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.
520 $a 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.
650 0 $a Algorithms. $3 527865
650 0 $a Computer graphics. $3 561602
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Artificial intelligence. $3 559380
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Computer communication systems. $3 1115394
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Computer Graphics. $3 669895
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Artificial Intelligence. $3 646849
650 2 4 $a Data Structures. $3 669824
650 2 4 $a Computer Communication Networks. $3 669310
700 1 $a Gąsieniec, Leszek Antoni. $e editor. $1 https://orcid.org/0000-0003-1809-9814 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1258244
700 1 $a Jansson, Jesper. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1229187
700 1 $a Levcopoulos, Christos. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1229188
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030250263
776 0 8 $i Printed edition: $z 9783030250287
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-030-25027-0
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)