תמונות העטיפה

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

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

תיאור מלא

שמור ב:
מידע ביבליוגרפי
מחבר תאגידי: SpringerLink (Online service)
מחברים אחרים: Hirsch, Edward. (Editor, http://id.loc.gov/vocabulary/relators/edt), Kuznetsov, Sergei O. (Editor, http://id.loc.gov/vocabulary/relators/edt), Pin, Jean-Éric. (Editor, http://id.loc.gov/vocabulary/relators/edt), Vereshchagin, Nikolay. (Editor, http://id.loc.gov/vocabulary/relators/edt)
פורמט: אלקטרוני ספר אלקטרוני
שפה:English
יצא לאור: Cham : Springer International Publishing : Imprint: Springer, 2014.
מהדורה:1st ed. 2014.
סדרה:Theoretical Computer Science and General Issues ; 8476
נושאים:
Algorithms.
Computer science—Mathematics.
Computers.
Numerical analysis.
Computer logic.
Mathematical logic.
Algorithm Analysis and Problem Complexity.
Discrete Mathematics in Computer Science.
Computation by Abstract Devices.
Numeric Computing.
Logics and Meanings of Programs.
Mathematical Logic and Formal Languages.
גישה מקוונת:https://doi.org/10.1007/978-3-319-06686-8
תגים: הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
תוכן הענינים:
  • 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.

פריטים דומים