Muutke küpsiste eelistusi

Computer Science -- Theory and Applications: 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings 2015 ed. [Pehme köide]

Edited by , Edited by
  • Formaat: Paperback / softback, 443 pages, kõrgus x laius: 235x155 mm, kaal: 6964 g, 66 Illustrations, black and white; XX, 443 p. 66 illus., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 9139
  • Ilmumisaeg: 06-Jul-2015
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3319202960
  • ISBN-13: 9783319202969
Teised raamatud teemal:
  • Pehme köide
  • Hind: 48,70 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 57,29 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
Computer Science -- Theory and Applications: 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings 2015 ed.Suurem pilt
  • Formaat: Paperback / softback, 443 pages, kõrgus x laius: 235x155 mm, kaal: 6964 g, 66 Illustrations, black and white; XX, 443 p. 66 illus., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 9139
  • Ilmumisaeg: 06-Jul-2015
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3319202960
  • ISBN-13: 9783319202969
Teised raamatud teemal:
Püsilink: https://www.kriso.ee/db/9783319202969.html
Märksõnad:

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.

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 Barendregts
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.