View source for Reduction from Negative Triangle Detection to Maximum Subarray

← Reduction from Negative Triangle Detection to Maximum Subarray

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.

FROM: [[Negative Triangle Detection]] TO: [[Maximum Subarray]]

== Description == 



== Implications == 



== Year == 

2018

== Reference == 

V. V. Williams, R. R. Williams, Subcubic Equivalences Between Path, Matrix, and Triangle Problems. 2018.

https://dl.acm.org/doi/pdf/10.1145/3186893, Theorem 5.4

Return to Reduction from Negative Triangle Detection to Maximum Subarray.

Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Reduction_from_Negative_Triangle_Detection_to_Maximum_Subarray"

Navigation menu