Reduction from Maximum Subarray to Negative Triangle Detection

From Algorithm Wiki
Revision as of 10:55, 15 February 2023 by Admin (talk | contribs) (Created page with "FROM: Maximum Subarray TO: Negative Triangle Detection == Description == == Implications == == Year == 1998 == Reference == Hisao Tamaki and Takeshi Tokuyama. 1998. Algorithms for the maximum subarray problem based on matrix multiplication. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’98). 446–452. https://dl-acm-org.ezproxy.canberra.edu.au/doi/abs/10.5555/314613.314823")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

FROM: Maximum Subarray TO: Negative Triangle Detection

Description

Implications

Year

1998

Reference

Hisao Tamaki and Takeshi Tokuyama. 1998. Algorithms for the maximum subarray problem based on matrix multiplication. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’98). 446–452.

https://dl-acm-org.ezproxy.canberra.edu.au/doi/abs/10.5555/314613.314823

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Reduction_from_Maximum_Subarray_to_Negative_Triangle_Detection&oldid=45120"