Computer Science - Theory and Applications (Record no. 57975)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 04225nam a22006135i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 978-3-319-06686-8 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20200421112231.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 140602s2014 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9783319066868 |
| -- | 978-3-319-06686-8 |
| 082 04 - CLASSIFICATION NUMBER | |
| Call Number | 005.1 |
| 245 10 - TITLE STATEMENT | |
| Title | Computer Science - Theory and Applications |
| Sub Title | 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings / |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | XX, 389 p. 39 illus. |
| 490 1# - SERIES STATEMENT | |
| Series statement | Lecture Notes in Computer Science, |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Remark 2 | Finding 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 ## - SUMMARY, ETC. | |
| Summary, etc | This 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 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| General subdivision | Mathematics. |
| 700 1# - AUTHOR 2 | |
| Author 2 | Hirsch, Edward A. |
| 700 1# - AUTHOR 2 | |
| Author 2 | Kuznetsov, Sergei O. |
| 700 1# - AUTHOR 2 | |
| Author 2 | Pin, Jean-�Eric. |
| 700 1# - AUTHOR 2 | |
| Author 2 | Vereshchagin, Nikolay K. |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | http://dx.doi.org/10.1007/978-3-319-06686-8 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | eBooks |
| 264 #1 - | |
| -- | Cham : |
| -- | Springer International Publishing : |
| -- | Imprint: Springer, |
| -- | 2014. |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 347 ## - | |
| -- | text file |
| -- | |
| -- | rda |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer science. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computers. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Algorithms. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer logic. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Mathematical logic. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Numerical analysis. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer science |
| 650 14 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer Science. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Algorithm Analysis and Problem Complexity. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Discrete Mathematics in Computer Science. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computation by Abstract Devices. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Numeric Computing. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Logics and Meanings of Programs. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Mathematical Logic and Formal Languages. |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| -- | 0302-9743 ; |
| 912 ## - | |
| -- | ZDB-2-SCS |
| 912 ## - | |
| -- | ZDB-2-LNC |
No items available.