I guess a higher order n-ary "Boolean" formula could be converted into a binary Boolean formula in polynomial time.
Jim Bromer On Thu, Jul 2, 2015 at 12:34 PM, Jim Bromer <[email protected]> wrote: > Even if binary SAT is in polynomial time higher order n-ary SAT > problems may not be. > Jim Bromer > ------------------------------------------- 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
