Del 9139 i serien Lecture Notes in Computer Science

Computer Science -- Theory and Applications

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

Häftad, Engelska, 2015

709 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

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.

Produktinformation

Utgivningsdatum2015-07-06
Mått155 x 235 x 25 mm
Vikt698 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor443
FörlagSpringer International Publishing AG
ISBN9783319202969

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT
Programmeringsböcker inom Data och IT
Diskret matematik inom Naturvetenskap och teknik

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.