Abstract: Let $$\simeq$$ be a binary relation between sets of integers, and ≤R be a Post reducibility, i.e. a reflexive and transitive relation between sets of integers such that if A ≤R B then the computational complexity ...