Even though some proofs of complexity-theoretic theorems regularly assume some concrete choice of input encoding, one tries to keep the discussion abstract enough to be independent of the choice of encoding.
What is the concrete choice typically assumed by most complexity-theoretic theorems?
input encoding