LEADER 04973nam 22008295 450 001 9910484410803321 005 20230329161533.0 010 $a3-319-20297-9 024 7 $a10.1007/978-3-319-20297-6 035 $a(CKB)3710000000436907 035 $a(SSID)ssj0001558468 035 $a(PQKBManifestationID)16183861 035 $a(PQKBTitleCode)TC0001558468 035 $a(PQKBWorkID)14819342 035 $a(PQKB)10312750 035 $a(DE-He213)978-3-319-20297-6 035 $a(MiAaPQ)EBC6303569 035 $a(MiAaPQ)EBC5588242 035 $a(Au-PeEL)EBL5588242 035 $a(OCoLC)912855145 035 $a(PPN)186399618 035 $a(EXLCZ)993710000000436907 100 $a20150622d2015 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputer Science -- Theory and Applications $e10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings /$fedited by Lev D. Beklemishev, Daniil V. Musatov 205 $a1st ed. 2015. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2015. 215 $a1 online resource (XX, 443 p. 66 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v9139 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-319-20296-0 327 $aPropositional 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. 330 $aThis 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v9139 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aComputer science 606 $aNumerical analysis 606 $aMachine theory 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aTheory of Computation 606 $aNumerical Analysis 606 $aComputer Science Logic and Foundations of Programming 606 $aFormal Languages and Automata Theory 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aComputer science. 615 0$aNumerical analysis. 615 0$aMachine theory. 615 14$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aTheory of Computation. 615 24$aNumerical Analysis. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aFormal Languages and Automata Theory. 676 $a004 702 $aBeklemishev$b Lev D$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMusatov$b Daniil V$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484410803321 996 $aComputer Science - Theory and Applications$92889860 997 $aUNINA