1 option
Computer Science -- Theory and Applications : 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings / edited by Lev D. Beklemishev, Daniil V. Musatov.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 9139.
- Theoretical Computer Science and General Issues ; 9139
- Language:
- English
- Subjects (All):
- Algorithms.
- Computer science--Mathematics.
- Computer science.
- Computers.
- Numerical analysis.
- Computer logic.
- Logic, Symbolic and mathematical.
- Algorithm Analysis and Problem Complexity.
- Discrete Mathematics in Computer Science.
- Computation by Abstract Devices.
- Numeric Computing.
- Logics and Meanings of Programs.
- Mathematical Logic and Formal Languages.
- Local Subjects:
- Algorithm Analysis and Problem Complexity.
- Discrete Mathematics in Computer Science.
- Computation by Abstract Devices.
- Numeric Computing.
- Logics and Meanings of Programs.
- Mathematical Logic and Formal Languages.
- Physical Description:
- 1 online resource (XX, 443 pages) : 66 illustrations.
- Edition:
- First edition 2015.
- Contained In:
- Springer eBooks
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2015.
- System Details:
- text file PDF
- Summary:
- 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.
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-319-20297-6
- 9783319202976
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.