Cantitate/Preț
Produs
Total produse
Vezi coșul
Computer Science - Theory and Applications: 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings de Edward Hirsch

Computer Science - Theory and Applications: 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings: Lecture Notes in Computer Science, cartea 8476

Editat de Edward Hirsch, Sergei O. Kuznetsov, Jean-Éric Pin, Nikolay Vereshchagin
en Limba Engleză Paperback – 15 mai 2014
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32855 lei

Preț vechi: 41068 lei
-20% Nou

Puncte Express: 493
Preț estimativ în valută:
6288€ • 6554$ • 5235£

Carte tipărită la comandă

Livrare economică 06-20 ianuarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783319066851
ISBN-10: 3319066854
Pagini: 389
Ilustrații: XX, 389 p. 39 illus.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.58 kg
Ediția:2014
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Public țintă

Research

Cuprins

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.

Textul de pe ultima copertă

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.