Computer Science – Theory and Applications

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 The Equivalence of Sampling and Searching
3. Altmetric Badge
   Chapter 2 Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity
4. Altmetric Badge
   Chapter 3 Learning Read-Constant Polynomials of Constant Degree Modulo Composites
5. Altmetric Badge
   Chapter 4 On the Arithmetic Complexity of Euler Function
6. Altmetric Badge
   Chapter 5 Pseudo-random Graphs and Bit Probe Schemes with One-Sided Error
7. Altmetric Badge
   Chapter 6 Improving the Space-Bounded Version of Muchnik’s Conditional Complexity Theorem via “Naive” Derandomization
8. Altmetric Badge
   Chapter 7 The Complexity of Solving Reachability Games Using Value and Strategy Iteration
9. Altmetric Badge
   Chapter 8 Faster Polynomial Multiplication via Discrete Fourier Transforms
10. Altmetric Badge
    Chapter 9 Kolmogorov Complexity as a Language
11. Altmetric Badge
    Chapter 10 Almost k-Wise Independent Sets Establish Hitting Sets for Width-3 1-Branching Programs
12. Altmetric Badge
    Chapter 11 The Complexity of Inversion of Explicit Goldreich’s Function by DPLL Algorithms
13. Altmetric Badge
    Chapter 12 Gate Elimination for Linear Functions and New Feebly Secure Constructions
14. Altmetric Badge
    Chapter 13 Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas
15. Altmetric Badge
    Chapter 14 On Maltsev Digraphs
16. Altmetric Badge
    Chapter 15 Join-Reachability Problems in Directed Graphs
17. Altmetric Badge
    Chapter 16 Graphs of Bounded Treewidth Can Be Canonized in  $\mbox{{\sf AC}$^1$}$
18. Altmetric Badge
    Chapter 17 Snakes and Cellular Automata: Reductions and Inseparability Results
19. Altmetric Badge
    Chapter 18 Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width
20. Altmetric Badge
    Chapter 19 An Extended Tree-Width Notion for Directed Graphs Related to the Computation of Permanents
21. Altmetric Badge
    Chapter 20 Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees
22. Altmetric Badge
    Chapter 21 Compressed Membership in Automata with Compressed Labels
23. Altmetric Badge
    Chapter 22 Locally Decodable Codes
24. Altmetric Badge
    Chapter 23 Precedence Automata and Languages
25. Altmetric Badge
    Chapter 24 Orbits of Linear Maps and Regular Languages
26. Altmetric Badge
    Chapter 25 Shared-Memory Systems and Charts
27. Altmetric Badge
    Chapter 26 On the CSP Dichotomy Conjecture
28. Altmetric Badge
    Chapter 27 LR(0) Conjunctive Grammars and Deterministic Synchronized Alternating Pushdown Automata
29. Altmetric Badge
    Chapter 28 Two-Way Automata versus Logarithmic Space
30. Altmetric Badge
    Chapter 29 A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row
31. Altmetric Badge
    Chapter 30 Two Combinatorial Criteria for BWT Images
32. Altmetric Badge
    Chapter 31 Recent Results on Polynomial Identity Testing
33. Altmetric Badge
    Chapter 32 Towards Approximate Matching in Compressed Strings: Local Subsequence Recognition
34. Altmetric Badge
    Chapter 33 The Optimal Strategy for the Average Long-Lived Consensus
35. Altmetric Badge
    Chapter 34 Improved Online Scheduling in Maximizing Throughput of Equal Length Jobs
36. Altmetric Badge
    Chapter 35 Recognizing Sparse Perfect Elimination Bipartite Graphs
37. Altmetric Badge
    Chapter 36 A Multiple-Conclusion Calculus for First-Order Gödel Logic