AFAIK there is an O(n^3) solution to this problem. anybody with a O(n^2) or O(n) solution??
Mukesh Gupta Delhi College of Engineering On Thu, Oct 7, 2010 at 3:32 PM, tech rascal <techrascal...@gmail.com> wrote: > can u plz xplain?? > > > On Thu, Oct 7, 2010 at 2:32 PM, Chi <c...@linuxdna.com> wrote: > >> Travers the matrix in z-curve or hilbert-curve. This is a heuristic >> algo. Thus you can find largest square matrix. >> >> On Oct 7, 10:39 am, malli <mallesh...@gmail.com> wrote: >> > Largest Rectangle in a Matrix: >> > >> > Given an n by n matrix with zeros and ones, find the largest sub- >> > matrix full of ones in linear time. I was told that a solution with >> > O(n) time complexity exists. If there are n^2 elements in a n X n >> > matrix how does a linear solution exist? >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to algoge...@googlegroups.com. >> To unsubscribe from this group, send email to >> algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> >> . >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> >> > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algoge...@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
