recategorized by
1,260 views

1 Answer

0 votes
0 votes
possible parenthesized of a sequence of n matrices is  

Ω($2^{n}$)
Answer:

Related questions

1 votes
1 votes
1 answer
2
go_editor asked Jul 24, 2016
1,169 views
The time complexity of reccurence relation T(n) = T(n/3) + T(2n/3) +O(n) isO(Ig n)O(n)O(n Ig n)O(n$^2$)
1 votes
1 votes
1 answer
3
go_editor asked Jul 22, 2016
1,661 views
$\alpha - \beta$ cutoffs are applied toDepth first searchBest first searchMinimax searchBreadth first search
0 votes
0 votes
1 answer
4
im.raj asked Jun 16, 2016
1,933 views
The time complexity of an efficient algorithm to find the longest monotonically increasing subsequence of n numbers is$\text{O(n)}$$\text{O(n Ig n)}$$\text{O(n$^2$)}$None...