عنوان

Computer science -- theory and applications :

(Number (ISBN

303019955X

(Number (ISBN

9783030199555

Erroneous ISBN

9783030199548

Title Proper

Computer science -- theory and applications :

General Material Designation

[Book]

Other Title Information

14th International Computer Science Symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1-5, 2019, Proceedings /

First Statement of Responsibility

René van Bevern, Gregory Kucherov (eds.).

Place of Publication, Distribution, etc.

Cham, Switzerland :

Name of Publisher, Distributor, etc.

Springer,

Date of Publication, Distribution, etc.

2019.

Specific Material Designation and Extent of Item

1 online resource (xxv, 373 pages) :

Other Physical Details

illustrations (some color)

Series Title

Lecture notes in computer science ;

Series Title

LNCS sublibrary. SL 1, Theoretical computer science and general issues

Volume Designation

11532

Text of Note

International conference proceedings.

Text of Note

Includes bibliographical references and author index.

Text of Note

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.

0

Text of Note

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. --

Source for Acquisition/Subscription Address

Springer Nature

Stock Number

com.springer.onix.9783030199555

Parallel Title

CSR 2019

Computer algorithms, Congresses.

Computer science, Congresses.

Computer algorithms.

Computer science.

Number

Edition

Class number

Bevern, René van

Kucherov, Gregory

International Computer Science Symposium in Russia(14th :2019 :, Novosibirsk, Russia)

Date of Transaction

20200823091136.0

Cataloguing Rules (Descriptive Conventions))

pn

Electronic name

[Book]

Y