Hong Yang <hyang...@gmail.com> wrote in article <f31db34d0911110452x7786572ay4482dffc4824a...@mail.gmail.com> in gmane.comp.lang.haskell.cafe: > I want to shuffle the rows to maximize the number of columns whose first 100 > rows have at least one number
Sounds like the maximum coverage problem, which is said to be NP-hard. [citation needed] http://en.wikipedia.org/wiki/Maximum_coverage_problem -- Edit this signature at http://www.digitas.harvard.edu/cgi-bin/ken/sig The answer to the ultimate question of life the universe and everything = 42 but usually it's not. _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
