000 04225nam a22006135i 4500
001 978-3-319-06686-8
003 DE-He213
005 20200421112231.0
007 cr nn 008mamaa
008 140602s2014 gw | s |||| 0|eng d
020 _a9783319066868
_9978-3-319-06686-8
024 7 _a10.1007/978-3-319-06686-8
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
245 1 0 _aComputer Science - Theory and Applications
_h[electronic resource] :
_b9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings /
_cedited by Edward A. Hirsch, Sergei O. Kuznetsov, Jean-�Eric Pin, Nikolay K. Vereshchagin.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2014.
300 _aXX, 389 p. 39 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8476
505 0 _aFinding All Solutions of Equations in Free Groups and Monoids with Involution -- Algorithmic Meta Theorems for Sparse Graph Classes -- The Lattice of Definability -- Counting Popular Matchings in House Allocation Problems -- Vertex Disjoint Paths in Upward Planar Graphs -- On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains -- Testing low degree trigonometric polynomials -- Property Testing Bounds for Linear and Quadratic Functions via Parity Decision Trees -- A Fast Branching Algorithm for Cluster Vertex Deletion -- Separation Logic with One Quantified Variable -- Notions of metric dimension of corona products -- On the Complexity of Computing Two Nonlinearity Measures -- Model Checking for String Problems -- Semiautomatic Structures -- The Query Complexity of Witness Finding -- Primal implication as encryption -- Processing Succinct Matrices and Vectors -- Constraint Satisfaction with Counting Quantifiers -- Dynamic Complexity of Planar 3-connected Graph Isomorphism -- Fast Approximate Computations with Cauchy Matrices, Polynomials and Rational Functions -- First-Order Logic on CPDA Graphs -- Recognizing two-sided contexts in cubic time -- A Parameterized Algorithm for Packing Overlapping Subgraphs -- Crossing-free spanning trees in visibility graphs of points between monotone polygonal obstacles -- The Connectivity of Boolean Satisfiability -- Randomized communication complexity of approximating Kolmogorov complexity -- Space Saving by Dynamic Algebraization.
520 _aThis book constitutes the proceedings of the 9th International Computer Science Symposium in Russia, CSR 2014, held in Moscow, Russia, in June 2014. The 27 full papers presented in this volume were carefully reviewed and selected from 76 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 _aComputer science.
650 0 _aComputers.
650 0 _aAlgorithms.
650 0 _aComputer logic.
650 0 _aMathematical logic.
650 0 _aNumerical analysis.
650 0 _aComputer science
_xMathematics.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aComputation by Abstract Devices.
650 2 4 _aNumeric Computing.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aMathematical Logic and Formal Languages.
700 1 _aHirsch, Edward A.
_eeditor.
700 1 _aKuznetsov, Sergei O.
_eeditor.
700 1 _aPin, Jean-�Eric.
_eeditor.
700 1 _aVereshchagin, Nikolay K.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783319066851
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v8476
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-319-06686-8
912 _aZDB-2-SCS
912 _aZDB-2-LNC
942 _cEBK
999 _c57975
_d57975