↓ Skip to main content

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

Overview of attention for book
Cover of 'Computer Science - Theory and Applications : 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Finding All Solutions of Equations in Free Groups and Monoids with Involution
  3. Altmetric Badge
    Chapter 2 Algorithmic Meta Theorems for Sparse Graph Classes
  4. Altmetric Badge
    Chapter 3 The Lattice of Definability. Origins, Recent Developments, and Further Directions
  5. Altmetric Badge
    Chapter 4 Counting Popular Matchings in House Allocation Problems
  6. Altmetric Badge
    Chapter 5 Vertex Disjoint Paths in Upward Planar Graphs
  7. Altmetric Badge
    Chapter 6 On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains
  8. Altmetric Badge
    Chapter 7 Testing Low Degree Trigonometric Polynomials
  9. Altmetric Badge
    Chapter 8 Property Testing Bounds for Linear and Quadratic Functions via Parity Decision Trees
  10. Altmetric Badge
    Chapter 9 A Fast Branching Algorithm for Cluster Vertex Deletion
  11. Altmetric Badge
    Chapter 10 Separation Logic with One Quantified Variable
  12. Altmetric Badge
    Chapter 11 QuickXsort: Efficient Sorting with n log n  − 1.399 n  +  o ( n ) Comparisons on Average
  13. Altmetric Badge
    Chapter 12 Notions of Metric Dimension of Corona Products: Combinatorial and Computational Results
  14. Altmetric Badge
    Chapter 13 On the Complexity of Computing Two Nonlinearity Measures
  15. Altmetric Badge
    Chapter 14 Block Products and Nesting Negations in FO2
  16. Altmetric Badge
    Chapter 15 Model Checking for String Problems
  17. Altmetric Badge
    Chapter 16 Semiautomatic Structures
  18. Altmetric Badge
    Chapter 17 The Query Complexity of Witness Finding
  19. Altmetric Badge
    Chapter 18 Primal Implication as Encryption
  20. Altmetric Badge
    Chapter 19 Processing Succinct Matrices and Vectors
  21. Altmetric Badge
    Chapter 20 Constraint Satisfaction with Counting Quantifiers 2
  22. Altmetric Badge
    Chapter 21 Dynamic Complexity of Planar 3-Connected Graph Isomorphism
  23. Altmetric Badge
    Chapter 22 Fast Approximate Computations with Cauchy Matrices, Polynomials and Rational Functions
  24. Altmetric Badge
    Chapter 23 First-Order Logic on CPDA Graphs
  25. Altmetric Badge
    Chapter 24 Recognizing Two-Sided Contexts in Cubic Time
  26. Altmetric Badge
    Chapter 25 A Parameterized Algorithm for Packing Overlapping Subgraphs
  27. Altmetric Badge
    Chapter 26 Crossing-Free Spanning Trees in Visibility Graphs of Points between Monotone Polygonal Obstacles
  28. Altmetric Badge
    Chapter 27 The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits
  29. Altmetric Badge
    Chapter 28 Randomized Communication Complexity of Approximating Kolmogorov Complexity
  30. Altmetric Badge
    Chapter 29 Space Saving by Dynamic Algebraization
Attention for Chapter 14: Block Products and Nesting Negations in FO2
Altmetric Badge

Readers on

mendeley
2 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Block Products and Nesting Negations in FO2
Chapter number 14
Book title
Computer Science - Theory and Applications
Published in
Lecture notes in computer science, January 2014
DOI 10.1007/978-3-319-06686-8_14
Book ISBNs
978-3-31-906685-1, 978-3-31-906686-8
Authors

Fleischer, Lukas, Kufleitner, Manfred, Lauser, Alexander, Lukas Fleischer, Manfred Kufleitner, Alexander Lauser

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 50%
Student > Master 1 50%
Readers by discipline Count As %
Mathematics 1 50%
Computer Science 1 50%