Computer Science - Theory and Applications

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Well-Founded and Partial Stable Semantics Logical Aspects
3. Altmetric Badge
   Chapter 2 The Reachability Problem over Infinite Graphs
4. Altmetric Badge
   Chapter 3 Kolmogorov Complexity and Model Selection
5. Altmetric Badge
   Chapter 4 Automatic Verification of Heap-Manipulating Programs Using Separation Logic
6. Altmetric Badge
   Chapter 5 Canonical Calculi: Invertibility, Axiom Expansion and (Non)-determinism
7. Altmetric Badge
   Chapter 6 Integrality Property in Preemptive Parallel Machine Scheduling
8. Altmetric Badge
   Chapter 7 Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes
9. Altmetric Badge
   Chapter 8 k-SAT Is No Harder Than Decision-Unique-k-SAT
10. Altmetric Badge
    Chapter 9 Unique Decipherability in the Monoid of Languages: An Application of Rational Relations
11. Altmetric Badge
    Chapter 10 Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
12. Altmetric Badge
    Chapter 11 Approximability Distance in the Space of H-Colourability Problems
13. Altmetric Badge
    Chapter 12 On Random Ordering Constraints
14. Altmetric Badge
    Chapter 13 Depth Reduction for Circuits with a Single Layer of Modular Counting Gates
15. Altmetric Badge
    Chapter 14 A Feebly Secure Trapdoor Function
16. Altmetric Badge
    Chapter 15 Partitioning Graphs into Connected Parts
17. Altmetric Badge
    Chapter 16 Structural Complexity of AvgBPP
18. Altmetric Badge
    Chapter 17 Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials
19. Altmetric Badge
    Chapter 18 Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity
20. Altmetric Badge
    Chapter 19 One-Nonterminal Conjunctive Grammars over a Unary Alphabet
21. Altmetric Badge
    Chapter 20 Concatenation of Regular Languages and Descriptional Complexity
22. Altmetric Badge
    Chapter 21 Approximability of the Maximum Solution Problem for Certain Families of Algebras
23. Altmetric Badge
    Chapter 22 Complete Complexity Classification of Short Shop Scheduling
24. Altmetric Badge
    Chapter 23 Compressed Word Problems in HNN-Extensions and Amalgamated Products
25. Altmetric Badge
    Chapter 24 Variations on Muchnik’s Conditional Complexity Theorem
26. Altmetric Badge
    Chapter 25 An Optimal Bloom Filter Replacement Based on Matrix Solving
27. Altmetric Badge
    Chapter 26 Aperiodicity Measure for Infinite Sequences
28. Altmetric Badge
    Chapter 27 On the Complexity of Matroid Isomorphism Problems
29. Altmetric Badge
    Chapter 28 Breaking Anonymity by Learning a Unique Minimum Hitting Set
30. Altmetric Badge
    Chapter 29 The Budgeted Unique Coverage Problem and Color-Coding
31. Altmetric Badge
    Chapter 30 Formal Verification of Gate-Level Computer Systems
32. Altmetric Badge
    Chapter 31 On Models of a Nondeterministic Computation
33. Altmetric Badge
    Chapter 32 New Plain-Exponential Time Classes for Graph Homomorphism
34. Altmetric Badge
    Chapter 33 Languages Recognized with Unbounded Error by Quantum Finite Automata