To view matrix multiplication ordering as an optimal triangulation problem, label the sides of the regular polygon (except the top) with the matrix names, and the vertices of the polygon with the matrix dimensions. Label each diagonal of a triangulation with the product of the two labels on the triangle below it (below meaning opposite from the top edge).
The top edge will end up labeled with a formula for multiplying all the matrices together. Conversely, from any such formula we can determine a triangulation. To count the number of operations for matrix multiplication, we should simply let @=sum and q(T) be the product of the three numbers written at the corners of each triangle T.
https://github.com/zizzo/optimal-bst
guys i know that you got the NumBy download for the calculation of binaries ( the lengh is key of 3072 bits for a security of 280 binary operations)
AND FINALLY MEMORY
No comments:
Post a Comment