square root decomposition

English

Alternative forms

  • sqrt decomposition

Noun

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.
This article is issued from Wiktionary. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.