square root decomposition
Meanings
noun
- 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.
Word forms
This entry uses open data from Wiktionary (CC BY-SA/GFDL). Word forms are used for search and are not indexed as separate pages.