>> Google Books

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
言語:
英語
出版情報:
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 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 WMSOtU Winning Conditions
Asymptotically Precise Ranking Functions for Deterministic Size-Change Systems
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
続きを見る
書誌ID:
LB00386306
ISBN:
9783319202969 [3319202960]  CiNii Books  Webcat Plus  Google Books
9783319202976 [3319202979]  CiNii Books  Webcat Plus  Google Books
子書誌情報
Loading
オンライン
所蔵情報
Loading availability information

類似資料:

1
 
2
 
3
 
4
 
5
 
6
 
7
 
8
 
9
 
10
 
11
 
12
 

Shallit, Jeffrey, Okhotin, Alexander, SpringerLink (Online service)

Springer International Publishing : Imprint: Springer

Banerjee, Mohua, Krishna, Shankara Narayanan, SpringerLink (Online service)

Springer Berlin Heidelberg : Imprint: Springer

Italiano, Giuseppe F., Pighizzini, Giovanni, Sannella, Donald T., SpringerLink (Online service)

Springer Berlin Heidelberg : Imprint: Springer

Parisi-Presicce, Francesco, Westfechtel, Bernhard, SpringerLink (Online service)

Springer International Publishing : Imprint: Springer

Durand-Lose, Jerome, Nagy, Benedek, SpringerLink (Online service)

Springer International Publishing : Imprint: Springer

Kosowski, Adrian, Walukiewicz, Igor, SpringerLink (Online service)

Springer International Publishing : Imprint: Springer

Potapov, Igor, SpringerLink (Online service)

Springer International Publishing : Imprint: Springer

Ochoa, Gabriela, Chicano, Francisco, SpringerLink (Online service)

Springer International Publishing : Imprint: Springer

Dediu, Adrian-Horia, Formenti, Enrico, Martin-Vide, Carlos, Truthe, Bianca, SpringerLink (Online service)

Springer International Publishing : Imprint: Springer

Bampis, Evripidis, SpringerLink (Online service)

Springer International Publishing : Imprint: Springer

Sanita, Laura, Skutella, Martin, SpringerLink (Online service)

Springer International Publishing : Imprint: Springer

Falaschi, Moreno, SpringerLink (Online service)

Springer International Publishing : Imprint: Springer