LEADER 05356nam 22007695 450 001 9910337838203321 005 20230330041205.0 010 $a3-030-19955-X 024 7 $a10.1007/978-3-030-19955-5 035 $a(CKB)4100000008493336 035 $a(DE-He213)978-3-030-19955-5 035 $a(MiAaPQ)EBC5923538 035 $a(PPN)254464173 035 $a(EXLCZ)994100000008493336 100 $a20190515d2019 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aComputer Science ? Theory and Applications $e14th International Computer Science Symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1?5, 2019, Proceedings /$fedited by René van Bevern, Gregory Kucherov 205 $a1st ed. 2019. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2019. 215 $a1 online resource (XXV, 373 p. 992 illus., 23 illus. in color.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v11532 311 $a3-030-19954-1 320 $aIncludes bibliographical references and index. 327 $aApproximability 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. 330 $aThis 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v11532 606 $aComputer science 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aComputer arithmetic and logic units 606 $aArtificial intelligence?Data processing 606 $aArtificial intelligence 606 $aComputer Science Logic and Foundations of Programming 606 $aDiscrete Mathematics in Computer Science 606 $aAlgorithms 606 $aArithmetic and Logic Structures 606 $aData Science 606 $aArtificial Intelligence 615 0$aComputer science. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aAlgorithms. 615 0$aComputer arithmetic and logic units. 615 0$aArtificial intelligence?Data processing. 615 0$aArtificial intelligence. 615 14$aComputer Science Logic and Foundations of Programming. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aAlgorithms. 615 24$aArithmetic and Logic Structures. 615 24$aData Science. 615 24$aArtificial Intelligence. 676 $a004.015113 676 $a004 702 $avan Bevern$b René$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aKucherov$b Gregory$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910337838203321 996 $aComputer Science - Theory and Applications$92889860 997 $aUNINA