Cantitate/Preț
Produs
Total produse
Vezi coșul
Computer Science – Theory and Applications: 14th International Computer Science Symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1–5, 2019, Proceedings de René van Bevern

Computer Science – Theory and Applications: 14th International Computer Science Symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1–5, 2019, Proceedings: Lecture Notes in Computer Science, cartea 11532

Editat de René van Bevern, Gregory Kucherov
en Limba Engleză Paperback – 16 mai 2019
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32482 lei

Preț vechi: 40602 lei
-20% Nou

Puncte Express: 487
Preț estimativ în valută:
6217€ • 6558$ • 5181£

Carte tipărită la comandă

Livrare economică 02-16 ianuarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030199548
ISBN-10: 3030199541
Pagini: 350
Ilustrații: XXV, 373 p. 992 illus., 23 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.56 kg
Ediția:1st ed. 2019
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Cuprins

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.