On Wed, Feb 20, 2008 at 4:27 PM, J Storrs Hall, PhD <[EMAIL PROTECTED]> wrote: > OK, imagine a lifetime's experience is a billion symbol-occurences. Imagine > you have a heuristic that takes the problem down from NP-complete (which it > almost certainly is) to a linear system, so there is an N^3 algorithm for > solving it. We're talking order 1e27 ops.
That's kind of specious, since modern SAT and SMT solvers can solve many realistic instances of NP-complete problems for large n, surprisingly quickly... and without linearizing anything... Worst-case complexity doesn't mean much... ben ------------------------------------------- agi Archives: http://www.listbox.com/member/archive/303/=now RSS Feed: http://www.listbox.com/member/archive/rss/303/ Modify Your Subscription: http://www.listbox.com/member/?member_id=8660244&id_secret=95818715-a78a9b Powered by Listbox: http://www.listbox.com
