Computer Science – Theory and Applications

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Randomness – A Computational Complexity Perspective
3. Altmetric Badge
   Chapter 2 Cracks in the Defenses: Scouting Out Approaches on Circuit Lower Bounds
4. Altmetric Badge
   Chapter 3 On Formal Equivalence Verification of Hardware
5. Altmetric Badge
   Chapter 4 Twelve Problems in Proof Complexity
6. Altmetric Badge
   Chapter 5 Manifestation and Exploitation of Invariants in Bioinformatics
7. Altmetric Badge
   Chapter 6 Simple Stochastic Games, Mean Payoff Games, Parity Games
8. Altmetric Badge
   Chapter 7 Topological Semantics of Justification Logic
9. Altmetric Badge
   Chapter 8 A Logspace Algorithm for Partial 2-Tree Canonization
10. Altmetric Badge
    Chapter 9 A Triple Correspondence in Canonical Calculi: Strong Cut-Elimination, Coherence, and Non-deterministic Semantics
11. Altmetric Badge
    Chapter 10 Computing Longest Common Substrings Via Suffix Arrays
12. Altmetric Badge
    Chapter 11 Logic and Rational Languages of Words Indexed by Linear Orderings
13. Altmetric Badge
    Chapter 12 Complexity of the Bollobás-Riordan Polynomial
14. Altmetric Badge
    Chapter 13 A Complete Characterization of Nash-Solvability of Bimatrix Games in Terms of the Exclusion of Certain 2×2 Subgames
15. Altmetric Badge
    Chapter 14 Synchronization of Grammars
16. Altmetric Badge
    Chapter 15 Lower Bounds for Depth-2 and Depth-3 Boolean Circuits with Arbitrary Gates
17. Altmetric Badge
    Chapter 16 A Semantic Proof of Polytime Soundness of Light Affine Logic
18. Altmetric Badge
    Chapter 17 On Subword Complexity of Morphic Sequences
19. Altmetric Badge
    Chapter 18 Comparing Universal Covers in Polynomial Time
20. Altmetric Badge
    Chapter 19 S4LP and Local Realizability
21. Altmetric Badge
    Chapter 20 On the Expressive Power of Permanents and Perfect Matchings of Matrices of Bounded Pathwidth/Cliquewidth (Extended Abstract)
22. Altmetric Badge
    Chapter 21 The Most General Conservation Law for a Cellular Automaton
23. Altmetric Badge
    Chapter 22 Lower Bounds on Frequency Estimation of Data Streams (Extended Abstract)
24. Altmetric Badge
    Chapter 23 From Invariants to Canonization in Parallel
25. Altmetric Badge
    Chapter 24 Self-referentiality of Justified Knowledge
26. Altmetric Badge
    Chapter 25 On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata
27. Altmetric Badge
    Chapter 26 Public Key Encryption and Encryption Emulation Attacks
28. Altmetric Badge
    Chapter 27 A Uniform Lower Bound on Weights of Perceptrons
29. Altmetric Badge
    Chapter 28 Lambek Grammars with One Division Are Decidable in Polynomial Time
30. Altmetric Badge
    Chapter 29 Cryptanalysis of Stickel’s Key Exchange Scheme
31. Altmetric Badge
    Chapter 30 Combinatorial Complexity of Regular Languages
32. Altmetric Badge
    Chapter 31 On Sequences with Non-learnable Subsequences
33. Altmetric Badge
    Chapter 32 Algorithms for Multiterminal Cuts
34. Altmetric Badge
    Chapter 33 Two Sources Are Better Than One for Increasing the Kolmogorov Complexity of Infinite Sequences
35. Altmetric Badge
    Chapter 34 Multilayer Neuro-fuzzy Network for Short Term Electric Load Forecasting
36. Altmetric Badge
    Chapter 35 Invariant Generation for P-Solvable Loops with Assignments
37. Altmetric Badge
    Chapter 36 Using Coloured Petri Nets to Model and Verify Telecommunications Systems
38. Altmetric Badge
    Chapter 37 Additive Preconditioning for Matrix Computations
39. Altmetric Badge
    Chapter 38 Network as a Computer: Ranking Paths to Find Flows
40. Altmetric Badge
    Chapter 39 A Unified Categorical Approach for Attributed Graph Rewriting