> On Jun 25, 2015, at 11:02 AM, Jim Bromer <[email protected]> wrote: > > (Btw, I just thought about the intersection of the cubes problem and > it looks like it is polynomial to me.)
In real-world computing, many polynomial time algorithms are computationally intractable. Polynomial space complexity is even worse. If you are doing things at large scales, the upper bound of usefulness and practicality is a massively parallelizable O(n log n). ------------------------------------------- AGI Archives: https://www.listbox.com/member/archive/303/=now RSS Feed: https://www.listbox.com/member/archive/rss/303/21088071-f452e424 Modify Your Subscription: https://www.listbox.com/member/?member_id=21088071&id_secret=21088071-58d57657 Powered by Listbox: http://www.listbox.com
