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
 言語:
 英語
 出版情報:
 Cham : Springer International Publishing : Imprint: Springer, 2015
 形態:
 XX, 443 p. 66 illus
 著者名:
 シリーズ名:
 Lecture Notes in Computer Science ; 9139
 目次情報:

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’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 WMSOtU Winning Conditions Asymptotically Precise Ranking Functions for Deterministic SizeChange Systems 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  書誌ID:
 LB00386306
 ISBN:
 9783319202969 [3319202960]
9783319202976 [3319202979]
類似資料:
Springer International Publishing : Imprint: Springer 
Springer Berlin Heidelberg : Imprint: Springer 
Springer Berlin Heidelberg : Imprint: Springer 
Springer International Publishing : Imprint: Springer 
Springer International Publishing : Imprint: Springer 
Springer International Publishing : Imprint: Springer 
Springer International Publishing : Imprint: Springer 
Springer International Publishing : Imprint: Springer 
Springer International Publishing : Imprint: Springer 
Springer International Publishing : Imprint: Springer 
Springer International Publishing : Imprint: Springer 
Springer International Publishing : Imprint: Springer 