The Questionnaire algorithms have as a goal to rearrange/re-embed garbled data presented as a tensor (such as the "shuffled and disorganized" data presented above), to render the tensor as smooth (alternatively, as numerically compressible) as possible. This is quantified by the l 1 norm of the coefficients of the tensor in a tensor-Haar basis whose construction is detailed below. (The l 0 norm counts the number of nonzero coefficients, while the l p norm for p ≤ 1 is a measure of total complexity.)