The Resource Computer Science  Theory and Applications : 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 1317, 2015, Proceedings, edited by Lev D. Beklemishev, Daniil V. Musatov, (electronic book)
Computer Science  Theory and Applications : 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 1317, 2015, Proceedings, edited by Lev D. Beklemishev, Daniil V. Musatov, (electronic book)
Resource Information
The item Computer Science  Theory and Applications : 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 1317, 2015, Proceedings, edited by Lev D. Beklemishev, Daniil V. Musatov, (electronic book) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Liverpool.This item is available to borrow from 1 library branch.
Resource Information
The item Computer Science  Theory and Applications : 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 1317, 2015, Proceedings, edited by Lev D. Beklemishev, Daniil V. Musatov, (electronic book) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Liverpool.
This item is available to borrow from 1 library branch.
 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
 Language
 eng
 Extent
 XX, 443 p. 66 illus.
 Contents

 Propositional Proofs in Frege and Extended Frege Systems
 Circuit Complexity Meets OntologyBased Data Access
 NEXPCompleteness 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 kAbelian Complexity
 A PolynomialTime 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 Inplace 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 Selfverifying Finite Automata
 Automath Type Inclusion in Barendregt{u2019}s Cube
 Circuit Lower Bounds for AverageCase MA
 Making Randomness Public in UnboundedRound Information Complexity
 FirstOrder 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 fFactors
 Rewriting HigherOrder Stack Trees
 Interacting with Modal Logics in the Coq Proof Assistant
 Delay Games with WMSOþU Winning Conditions
 Asymptotically Precise Ranking Functions for Deterministic SizeChange Systems
 Isbn
 9783319202976
 Label
 Computer Science  Theory and Applications : 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 1317, 2015, Proceedings
 Title
 Computer Science  Theory and Applications
 Title remainder
 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 1317, 2015, Proceedings
 Statement of responsibility
 edited by Lev D. Beklemishev, Daniil V. Musatov
 Language
 eng
 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
 Cataloging source
 DEHe213
 Dewey number
 005.1
 Image bit depth
 0
 LC call number
 QA76.9.A43
 Literary form
 non fiction
 http://bibfra.me/vocab/lite/meetingDate
 2015
 http://bibfra.me/vocab/lite/meetingName
 International Computer Science Symposium in Russia
 http://library.link/vocab/relatedWorkOrContributorDate
 1967
 http://library.link/vocab/relatedWorkOrContributorName

 Beklemishev, Lev Dmitrievich
 Musatov, Daniil V.
 Series statement
 Lecture Notes in Computer Science,
 Series volume
 9139
 http://library.link/vocab/subjectName

 Computer science
 Computer software
 Logic design
 Electronic data processing
 Computational complexity
 Label
 Computer Science  Theory and Applications : 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 1317, 2015, Proceedings, edited by Lev D. Beklemishev, Daniil V. Musatov, (electronic book)
 Antecedent source
 mixed
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Color
 not applicable
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 Propositional Proofs in Frege and Extended Frege Systems  Circuit Complexity Meets OntologyBased Data Access  NEXPCompleteness 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 kAbelian Complexity  A PolynomialTime 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 Inplace 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 Selfverifying Finite Automata  Automath Type Inclusion in Barendregt{u2019}s Cube  Circuit Lower Bounds for AverageCase MA  Making Randomness Public in UnboundedRound Information Complexity  FirstOrder 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 fFactors  Rewriting HigherOrder Stack Trees  Interacting with Modal Logics in the Coq Proof Assistant  Delay Games with WMSOþU Winning Conditions  Asymptotically Precise Ranking Functions for Deterministic SizeChange Systems
 Control code
 9783319202976
 Dimensions
 unknown
 Extent
 XX, 443 p. 66 illus.
 File format
 multiple file formats
 Form of item
 electronic
 Isbn
 9783319202976
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/9783319202976
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Reproduction note
 Electronic resource.
 Specific material designation
 remote
 Label
 Computer Science  Theory and Applications : 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 1317, 2015, Proceedings, edited by Lev D. Beklemishev, Daniil V. Musatov, (electronic book)
 Antecedent source
 mixed
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Color
 not applicable
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 Propositional Proofs in Frege and Extended Frege Systems  Circuit Complexity Meets OntologyBased Data Access  NEXPCompleteness 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 kAbelian Complexity  A PolynomialTime 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 Inplace 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 Selfverifying Finite Automata  Automath Type Inclusion in Barendregt{u2019}s Cube  Circuit Lower Bounds for AverageCase MA  Making Randomness Public in UnboundedRound Information Complexity  FirstOrder 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 fFactors  Rewriting HigherOrder Stack Trees  Interacting with Modal Logics in the Coq Proof Assistant  Delay Games with WMSOþU Winning Conditions  Asymptotically Precise Ranking Functions for Deterministic SizeChange Systems
 Control code
 9783319202976
 Dimensions
 unknown
 Extent
 XX, 443 p. 66 illus.
 File format
 multiple file formats
 Form of item
 electronic
 Isbn
 9783319202976
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/9783319202976
 Other physical details
 online resource.
 Quality assurance targets
 absent
 Reformatting quality
 access
 Reproduction note
 Electronic resource.
 Specific material designation
 remote
Library Links
Embed (Experimental)
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.liverpool.ac.uk/portal/ComputerScienceTheoryandApplications/rCJZ05IynnM/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.liverpool.ac.uk/portal/ComputerScienceTheoryandApplications/rCJZ05IynnM/">Computer Science  Theory and Applications : 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 1317, 2015, Proceedings, edited by Lev D. Beklemishev, Daniil V. Musatov, (electronic book)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.liverpool.ac.uk/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.liverpool.ac.uk/">University of Liverpool</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Computer Science  Theory and Applications : 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 1317, 2015, Proceedings, edited by Lev D. Beklemishev, Daniil V. Musatov, (electronic book)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.liverpool.ac.uk/portal/ComputerScienceTheoryandApplications/rCJZ05IynnM/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.liverpool.ac.uk/portal/ComputerScienceTheoryandApplications/rCJZ05IynnM/">Computer Science  Theory and Applications : 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 1317, 2015, Proceedings, edited by Lev D. Beklemishev, Daniil V. Musatov, (electronic book)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.liverpool.ac.uk/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.liverpool.ac.uk/">University of Liverpool</a></span></span></span></span></div>