Cargando…

Computer Science -- Theory and Applications 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings /

This book constitutes the proceedings of the 10th International Computer Science Symposium in Russia, CSR 2015, held in Listvyanka, Russia, in July 2015. The 25 full papers presented in this volume were carefully reviewed and selected from 61 submissions. In addition the book contains 4 invited lect...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Beklemishev, Lev D. (Editor ), Musatov, Daniil V. (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Cham : Springer International Publishing : Imprint: Springer, 2015.
Edición:1st ed. 2015.
Colección:Theoretical Computer Science and General Issues, 9139
Temas:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-319-20297-6
003 DE-He213
005 20230329161533.0
007 cr nn 008mamaa
008 150622s2015 sz | s |||| 0|eng d
020 |a 9783319202976  |9 978-3-319-20297-6 
024 7 |a 10.1007/978-3-319-20297-6  |2 doi 
050 4 |a QA76.9.A43 
072 7 |a UMB  |2 bicssc 
072 7 |a COM051300  |2 bisacsh 
072 7 |a UMB  |2 thema 
082 0 4 |a 518.1  |2 23 
245 1 0 |a Computer Science -- Theory and Applications  |h [electronic resource] :  |b 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings /  |c edited by Lev D. Beklemishev, Daniil V. Musatov. 
250 |a 1st ed. 2015. 
264 1 |a Cham :  |b Springer International Publishing :  |b Imprint: Springer,  |c 2015. 
300 |a XX, 443 p. 66 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Theoretical Computer Science and General Issues,  |x 2512-2029 ;  |v 9139 
505 0 |a Propositional Proofs in Frege and Extended Frege Systems -- Circuit Complexity Meets Ontology-Based Data Access -- NEXP-Completeness and Universal Hardness Results for Justification Logic -- A Combinatorial Algorithm for the Planar Multi flow Problem with Demands Located on Three Holes -- Generalized LR Parsing for Grammars with Contexts -- On Compiling Structured CNFs to OBDDs -- Satisfiability of ECTL* with Tree Constraints -- On Growth and Fluctuation of k-Abelian Complexity -- A Polynomial-Time Algorithm for Outerplanar Diameter Improvement -- Editing to a Planar Graph of Given Degrees -- On the Satisfiability of Quantum Circuits of Small Treewidth -- Equations over Free Inverse Monoids with Idempotent Variables -- A Logical Characterization of Timed Pushdown Languages -- An In-place Priority Queue with O(1) Time for Push and lg n + O(1) Comparisons for Pop -- Resolution Complexity of Perfect Matching Principles for Sparse Graphs -- Operations on Self-verifying Finite Automata -- Automath Type Inclusion in Barendregt's Cube -- Circuit Lower Bounds for Average-Case MA -- Making Randomness Public in Unbounded-Round Information Complexity -- First-Order Logic Definability of Free Languages -- Representation of (Left) Ideal Regular Languages by Synchronizing Automata -- Some Properties of Antistochastic Strings -- Approximation and Exact Algorithms for Special Cases of Connected f-Factors -- Rewriting Higher-Order Stack Trees -- Interacting with Modal Logics in the Coq Proof Assistant -- Delay Games with WMSOþU Winning Conditions -- Asymptotically Precise Ranking Functions for Deterministic Size-Change Systems. 
520 |a This book constitutes the proceedings of the 10th International Computer Science Symposium in Russia, CSR 2015, held in Listvyanka, Russia, in July 2015. The 25 full papers presented in this volume were carefully reviewed and selected from 61 submissions. In addition the book contains 4 invited lectures. The scope of the proposed topics is quite broad and covers a wide range of areas in theoretical computer science and its applications. 
650 0 |a Algorithms. 
650 0 |a Computer science-Mathematics. 
650 0 |a Discrete mathematics. 
650 0 |a Computer science. 
650 0 |a Numerical analysis. 
650 0 |a Machine theory. 
650 1 4 |a Algorithms. 
650 2 4 |a Discrete Mathematics in Computer Science. 
650 2 4 |a Theory of Computation. 
650 2 4 |a Numerical Analysis. 
650 2 4 |a Computer Science Logic and Foundations of Programming. 
650 2 4 |a Formal Languages and Automata Theory. 
700 1 |a Beklemishev, Lev D.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Musatov, Daniil V.  |e editor.  |0 (orcid)0000-0002-1779-2513  |1 https://orcid.org/0000-0002-1779-2513  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783319202983 
776 0 8 |i Printed edition:  |z 9783319202969 
830 0 |a Theoretical Computer Science and General Issues,  |x 2512-2029 ;  |v 9139 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-3-319-20297-6  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)