Computer science -- theory and applications : 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings /: 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings. (2015)

• Record Type: Book
• Other Titles: CSR 2015
• Further Information: Note: Lev D. Beklemishev, Daniil V. Musatov (eds.).
• Editors: Beklemishev, Lev Dmitrievich, 1967-; Musatov, Daniil V
• Other Names: International Computer Science Symposium in Russia, 10th
• Contents: 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.
• Publisher Details: Cham : Springer
• Publication Date: 2015
• Extent: 1 online resource (xx, 443 pages), illustrations
• Subjects: 004; Computer science; Computer science -- Congresses; Computer science; Computer Science; Engineering & Applied Sciences; Computers -- Data Processing; Computers -- Machine Theory; Computers -- Programming -- Algorithms; Computers -- Programming -- General; Mathematics -- Logic; Discrete mathematics; User interface design & usability; Mathematical theory of computation; Computer programming / software development; Computer software; Computational complexity; Electronic data processing; Logic design; Algorithms & data structures; Electronic books; Conference papers and proceedings; Electronic books
• Languages: English
• ISBNs: 9783319202976; 3319202979; 3319202960; 9783319202969
• Related ISBNs: 9783319202969
• Notes: Note: Includes bibliographical references and author index.; Note: Online resource; title from PDF title page (SpringerLink, viewed June 29, 2015).
• Access Rights: Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
• Access Usage: Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.