Muutke küpsiste eelistusi

E-raamat: Computer Science -- Theory and Applications: 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings

Edited by , Edited by
Teised raamatud teemal:
  • Formaat - PDF+DRM
  • Hind: 55,56 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
Computer Science -- Theory and Applications: 10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, ProceedingsSuurem pilt
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

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.
Lisainfo e-raamatute kohta Lisainfo e-raamatute kohta
Püsilink: https://www.kriso.ee/db/97833192029762e.html
Märksõnad: