> solving Linear Programming Problems with O(L^1.5) > computational complexity
I'm not an expert on this topic. However, a quick glance at the topic suggests that these sorts of algorithms are usually exponential in "n", here the number of variables/dimensions. Apparently, "L" is the number of input bits. Your notation suggests your algorithm is dependent on the number input bits only, and is otherwise constant in the number of variables/dimensions. So, we can solve an LP with hundreds of millions of variables, near-instantaneously...? ______________________________________________ R-help@r-project.org mailing list -- To UNSUBSCRIBE and more, see https://stat.ethz.ch/mailman/listinfo/r-help PLEASE do read the posting guide http://www.R-project.org/posting-guide.html and provide commented, minimal, self-contained, reproducible code.
