01075nam0 22002891i 450 UON0046580520231205105143.514978-88-7536-354-320160315d2014 |0itac50 baitaIT|||| 1||||Abbiamo tempo per tuttoOctavian PalerCura e traduzione dal romeno di Magda ArhipNovi Ligure (AL) : Ed. Joker201464 p.ill. ; 21 cmTesto originale a fronteITNovi Ligure (AL)UONL002508859Letteratura romena e letterature ladine21PALEROctavianUONV206877707532ArhipMagdaUONV230703JokerUONV277972650ITSOL20250523RICASIBA - SISTEMA BIBLIOTECARIO DI ATENEOUONSIUON00465805SIBA - SISTEMA BIBLIOTECARIO DI ATENEOSI B 0017 SI 16746 7 0017 Abbiamo tempo per tutto1398741UNIOR05352nam 22007695 450 991033783820332120251225193649.03-030-19955-X10.1007/978-3-030-19955-5(CKB)4100000008493336(DE-He213)978-3-030-19955-5(MiAaPQ)EBC5923538(PPN)254464173(EXLCZ)99410000000849333620190515d2019 u| 0engurnn#008mamaatxtrdacontentcrdamediacrrdacarrierComputer Science – Theory and Applications 14th International Computer Science Symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1–5, 2019, Proceedings /edited by René van Bevern, Gregory Kucherov1st ed. 2019.Cham :Springer International Publishing :Imprint: Springer,2019.1 online resource (XXV, 373 p. 992 illus., 23 illus. in color.)Theoretical Computer Science and General Issues,2512-2029 ;115323-030-19954-1 Includes bibliographical references and index.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.Theoretical Computer Science and General Issues,2512-2029 ;11532Computer scienceComputer scienceMathematicsDiscrete mathematicsAlgorithmsComputer arithmetic and logic unitsArtificial intelligenceData processingArtificial intelligenceComputer Science Logic and Foundations of ProgrammingDiscrete Mathematics in Computer ScienceAlgorithmsArithmetic and Logic StructuresData ScienceArtificial IntelligenceComputer science.Computer scienceMathematics.Discrete mathematics.Algorithms.Computer arithmetic and logic units.Artificial intelligenceData processing.Artificial intelligence.Computer Science Logic and Foundations of Programming.Discrete Mathematics in Computer Science.Algorithms.Arithmetic and Logic Structures.Data Science.Artificial Intelligence.004.015113004van Bevern Renéedthttp://id.loc.gov/vocabulary/relators/edtKucherov Gregoryedthttp://id.loc.gov/vocabulary/relators/edtMiAaPQMiAaPQMiAaPQBOOK9910337838203321Computer Science - Theory and Applications2889860UNINA