國立虎尾科技大學 |

Computer Science – Theory and Applications = 14th International Computer Science Symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1–5, 2019, Proceedings /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Computer Science – Theory and Applications/ edited by René van Bevern, Gregory Kucherov.
其他題名:	14th International Computer Science Symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1–5, 2019, Proceedings /
其他作者:	van Bevern, René.
面頁冊數:	XXV, 373 p. 992 illus., 23 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Computer logic. -
電子資源:	https://doi.org/10.1007/978-3-030-19955-5
ISBN:	9783030199555

Computer Science – Theory and Applications = 14th International Computer Science Symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1–5, 2019, Proceedings /
Computer Science – Theory and Applications14th International Computer Science Symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1–5, 2019, Proceedings /[electronic resource] :edited by René van Bevern, Gregory Kucherov. - 1st ed. 2019. - XXV, 373 p. 992 illus., 23 illus. in color.online resource. - Theoretical Computer Science and General Issues ;11532. - Theoretical Computer Science and General Issues ;9163.

Approximability and Inapproximability for Maximum k-Edge-Colored Clustering Problem -- The Non-Hardness of Approximating Circuit Size -- Reconstructing a convex polygon from its omega-cloud -- A Space-efficient Parameterized Algorithm for the Hamiltonian Cycle Problem by Dynamic Algebraization -- Quantum Algorithm for Distribution-Free Junta Testing -- On Induced Online Ramsey Number of Paths, Cycles, and Trees -- Approximations of Schatten Norms via Taylor Expansions -- Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes -- Belga B-trees -- Eventually dendric shifts -- On Decidability of Regular Languages Theories -- Minimizing Branching Vertices in Distance-preserving Subgraphs -- On Tseitin formulas, read-once branching programs and treewidth -- Matched instances of Quantum Sat (QSat) - Product state solutions of Restrictions -- Notes on resolution over linear equations -- Undecidable word problem in subshift automorphism groups -- Parameterized Complexity of Conflict-Free Set Cover -- Forward Looking Huffman Coding -- Computational Complexity of Real Powering and Improved Solving Linear Differential Equations -- On the Quantum and Classical Complexity of Solving Subtraction Games -- Derandomization for sliding window algorithms with strict correctness -- On the Complexity of Restarting -- On the Complexity of Mixed Dominating Set -- Uniform CSP Parameterized by Solution Size is in W[1] -- On the Parameterized Complexity of Edge-Linked Paths -- The Parameterized Complexity of Dominating Set and Friends Revisited -- Transition property for cube-free words -- A Polynomial Time Delta-Decomposition Algorithm for Positive DNFs -- Unpopularity Factor in the Marriage and Roommates Problems -- AND Protocols Using Only Uniform Shuffles -- Sybil-Resilient Conductance-Based Community Expansion.

This book constitutes the proceedings of the 14th International Computer Science Symposium in Russia, CSR 2019, held in Novosibirsk, Russia, in July 2019. The 31 full papers were carefully reviewed and selected from 71 submissions. The papers cover a wide range of topics such as algorithms and data structures; computational complexity; randomness in computing; approximation algorithms; combinatorial optimization; constraint satisfaction; computational geometry; formal languages and automata; codes and cryptography; combinatorics in computer science; applications of logic to computer science; proof complexity; fundamentals of machine learning; and theoretical aspects of big data.

ISBN: 9783030199555

Standard No.: 10.1007/978-3-030-19955-5doiSubjects--Topical Terms:

786340
Computer logic.

LC Class. No.: QA76.9.L63

Dewey Class. No.: 005.1015113

Computer Science – Theory and Applications = 14th International Computer Science Symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1–5, 2019, Proceedings /
LDR:04118nam a22004335i 4500 001 1003944
003 DE-He213
005 20200703145007.0
007 cr nn 008mamaa
008 210106s2019 gw | s |||| 0|eng d
020 $a 9783030199555 $9 978-3-030-19955-5
024 7 $a 10.1007/978-3-030-19955-5 $2 doi
035 $a 978-3-030-19955-5
050 4 $a QA76.9.L63
050 4 $a QA76.5913
072 7 $a UM $2 bicssc
072 7 $a COM051000 $2 bisacsh
072 7 $a UM $2 thema
072 7 $a UYF $2 thema
082 0 4 $a 005.1015113 $2 23
245 1 0 $a Computer Science – Theory and Applications $h [electronic resource] : $b 14th International Computer Science Symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1–5, 2019, Proceedings / $c edited by René van Bevern, Gregory Kucherov.
250 $a 1st ed. 2019.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a XXV, 373 p. 992 illus., 23 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 11532
505 0 $a Approximability and Inapproximability for Maximum k-Edge-Colored Clustering Problem -- The Non-Hardness of Approximating Circuit Size -- Reconstructing a convex polygon from its omega-cloud -- A Space-efficient Parameterized Algorithm for the Hamiltonian Cycle Problem by Dynamic Algebraization -- Quantum Algorithm for Distribution-Free Junta Testing -- On Induced Online Ramsey Number of Paths, Cycles, and Trees -- Approximations of Schatten Norms via Taylor Expansions -- Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes -- Belga B-trees -- Eventually dendric shifts -- On Decidability of Regular Languages Theories -- Minimizing Branching Vertices in Distance-preserving Subgraphs -- On Tseitin formulas, read-once branching programs and treewidth -- Matched instances of Quantum Sat (QSat) - Product state solutions of Restrictions -- Notes on resolution over linear equations -- Undecidable word problem in subshift automorphism groups -- Parameterized Complexity of Conflict-Free Set Cover -- Forward Looking Huffman Coding -- Computational Complexity of Real Powering and Improved Solving Linear Differential Equations -- On the Quantum and Classical Complexity of Solving Subtraction Games -- Derandomization for sliding window algorithms with strict correctness -- On the Complexity of Restarting -- On the Complexity of Mixed Dominating Set -- Uniform CSP Parameterized by Solution Size is in W[1] -- On the Parameterized Complexity of Edge-Linked Paths -- The Parameterized Complexity of Dominating Set and Friends Revisited -- Transition property for cube-free words -- A Polynomial Time Delta-Decomposition Algorithm for Positive DNFs -- Unpopularity Factor in the Marriage and Roommates Problems -- AND Protocols Using Only Uniform Shuffles -- Sybil-Resilient Conductance-Based Community Expansion.
520 $a This book constitutes the proceedings of the 14th International Computer Science Symposium in Russia, CSR 2019, held in Novosibirsk, Russia, in July 2019. The 31 full papers were carefully reviewed and selected from 71 submissions. The papers cover a wide range of topics such as algorithms and data structures; computational complexity; randomness in computing; approximation algorithms; combinatorial optimization; constraint satisfaction; computational geometry; formal languages and automata; codes and cryptography; combinatorics in computer science; applications of logic to computer science; proof complexity; fundamentals of machine learning; and theoretical aspects of big data.
650 0 $a Computer logic. $3 786340
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Algorithms. $3 527865
650 0 $a Arithmetic and logic units, Computer. $3 1255170
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Artificial intelligence. $3 559380
650 1 4 $a Logics and Meanings of Programs. $3 670058
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 593923
650 2 4 $a Arithmetic and Logic Structures. $3 672631
650 2 4 $a Data Structures. $3 669824
650 2 4 $a Artificial Intelligence. $3 646849
700 1 $a van Bevern, René. $e editor. $1 https://orcid.org/0000-0002-4805-218X $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1297312
700 1 $a Kucherov, Gregory. $e editor. $1 https://orcid.org/0000-0001-5899-5424 $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 1297313
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030199548
776 0 8 $i Printed edition: $z 9783030199562
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-19955-5
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)