square root decomposition

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English

[edit]

Alternative forms

[edit]

Noun

[edit]

square root decomposition (plural square root decompositions)

  1. (computer science) A technique that can reduce the runtime of an algorithm by a factor of (where is the size of the input) by dividing the input into chunks and performing operations on whole chunks when possible.