View source for Brute Force (Matrix Chain Ordering Problem Matrix Chain Multiplication)

← Brute Force (Matrix Chain Ordering Problem Matrix Chain Multiplication)

Jump to navigation Jump to search

You do not have permission to edit this page, for the following reason:

The action you have requested is limited to users in the group: Users.

You can view and copy the source of this page.

== Time Complexity == 

$O({4}^n)$

== Space Complexity == 

$O(n)$ words

(can be derived)

== Description == 



== Approximate? == 

Exact

== Randomized? == 

No, deterministic

== Model of Computation == 

Word RAM

== Year == 

1940

== Reference == 

-

Return to Brute Force (Matrix Chain Ordering Problem Matrix Chain Multiplication).

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/wiki/Brute_Force_(Matrix_Chain_Ordering_Problem_Matrix_Chain_Multiplication)"

Navigation menu