Does anyone knew more effective solution then DP? On Oct 12, 3:46 pm, Andrey <[EMAIL PROTECTED]> wrote: > I doubt It will be O(n^3).. > Dynamic programming algorithm, by size of submatrix, will give at > least O(N ^ 4), won't it?
--~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
