square root decomposition noun1 •A technique that can reduce the runtime of an algorithm by a factor of √ (where n is the size of the input) by dividing the input into √ chunks and performing operations on whole chunks when possible. formssquare root decompositions
