KonkurStudy
همه کارت‌ها

Matrix-Chain Multiplication Ordering

Matrix multiplication is associative but its scalar-multiplication cost is not, so dynamic programming over interval splits finds the cheapest parenthesization in Θ(n3)\Theta(n^{3}) time.

کارت الگوریتم کنکور ارشد علوم کامپیوتر