000 05021nam a22006375i 4500
001 978-3-030-19955-5
003 DE-He213
005 20240423124955.0
007 cr nn 008mamaa
008 190515s2019 sz | s |||| 0|eng d
020 _a9783030199555
_9978-3-030-19955-5
024 7 _a10.1007/978-3-030-19955-5
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aComputer Science – Theory and Applications
_h[electronic resource] :
_b14th International Computer Science Symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1–5, 2019, Proceedings /
_cedited by René van Bevern, Gregory Kucherov.
250 _a1st ed. 2019.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2019.
300 _aXXV, 373 p. 992 illus., 23 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 ;
_v11532
505 0 _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.
520 _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.
650 0 _aComputer science.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 0 _aAlgorithms.
650 0 _aComputer arithmetic and logic units.
650 0 _aArtificial intelligence
_xData processing.
650 0 _aArtificial intelligence.
650 1 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aAlgorithms.
650 2 4 _aArithmetic and Logic Structures.
650 2 4 _aData Science.
650 2 4 _aArtificial Intelligence.
700 1 _avan Bevern, René.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aKucherov, Gregory.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030199548
776 0 8 _iPrinted edition:
_z9783030199562
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v11532
856 4 0 _uhttps://doi.org/10.1007/978-3-030-19955-5
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c172793
_d172793