Computer Science - Theory and Applications (häftad)
Fler böcker inom
Format
Häftad (Paperback / softback)
Språk
Engelska
Antal sidor
389
Utgivningsdatum
2014-05-15
Upplaga
2014 ed.
Förlag
Springer International Publishing AG
Medarbetare
Hirsch, Edward (ed.), Kuznetsov, Sergei O. (ed.), Pin, Jean-Éric (ed.), Vereshchagin, Nikolay (ed.)
Illustratör/Fotograf
Bibliographie
Illustrationer
39 Illustrations, black and white; XX, 389 p. 39 illus.
Dimensioner
234 x 156 x 21 mm
Vikt
577 g
Antal komponenter
1
Komponenter
1 Paperback / softback
ISBN
9783319066851

Computer Science - Theory and Applications

9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings

av Edward Hirsch, Sergei O Kuznetsov, Jean-Ric Pin, Nikolay Vereshchagin
Häftad,  Engelska, 2014-05-15
579
Köp
Spara som favorit
  • Skickas från oss inom 10-15 vardagar.
  • Fri frakt över 249 kr för privatkunder i Sverige.
This book constitutes the proceedings of the 9th International Computer Science Symposium in Russia, CSR 2014, held in Moscow, Russia, in June 2014. The 27 full papers presented in this volume were carefully reviewed and selected from 76 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.
Visa hela texten

Passar bra ihop

  1. Computer Science - Theory and Applications
  2. +
  3. Nexus

De som köpt den här boken har ofta också köpt Nexus av Yuval Noah Harari (häftad).

Köp båda 2 för 818 kr

Kundrecensioner

Har du läst boken? Sätt ditt betyg »

Fler böcker av författarna

Edward Hirsch, Sergei O Kuznetsov, Jean-Ric Pin, Nikolay Vereshchagin

Innehållsförteckning

Finding All Solutions of Equations in Free Groups and Monoids with Involution.- Algorithmic Meta Theorems for Sparse Graph Classes.- The Lattice of Definability.- Counting Popular Matchings in House Allocation Problems.- Vertex Disjoint Paths in Upward Planar Graphs.- On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains.- Testing low degree trigonometric polynomials.- Property Testing Bounds for Linear and Quadratic Functions via Parity Decision Trees.- A Fast Branching Algorithm for Cluster Vertex Deletion.- Separation Logic with One Quantified Variable.- Notions of metric dimension of corona products.- On the Complexity of Computing Two Nonlinearity Measures.- Model Checking for String Problems.- Semiautomatic Structures.- The Query Complexity of Witness Finding.- Primal implication as encryption.- Processing Succinct Matrices and Vectors.- Constraint Satisfaction with Counting Quantifiers.- Dynamic Complexity of Planar 3-connected Graph Isomorphism.- Fast Approximate Computations with Cauchy Matrices, Polynomials and Rational Functions.- First-Order Logic on CPDA Graphs.- Recognizing two-sided contexts in cubic time.- A Parameterized Algorithm for Packing Overlapping Subgraphs.- Crossing-free spanning trees in visibility graphs of points between monotone polygonal obstacles.- The Connectivity of Boolean Satisfiability.- Randomized communication complexity of approximating Kolmogorov complexity.- Space Saving by Dynamic Algebraization.

Du kanske gillar