I solved SAT (boolean satisfiability), what now?

1 points by sat_solver 2 years ago | 3 comments

Hi all, I discovered a solution to the SAT problem (boolean satisfiability) that runs in time complexity O(n*log(m)), and space O(2^n), where m is the number of inputs and n is the number of boolean operations. I have spent a few months solving various SAT problems with a program I wrote. I'm a senior in high school. What should I do? Advice would be appreciated. Thank you in advance.

yorwba 2 years ago |

How can your program use O(2^n) space in less than O(2^n) time? Do you just allocate a huge chunk of memory but don't use most of it? If so, you can replace it by a hash table using O(n² * log(m)) space at an amortized constant cost per memory operation.

Once you have reduced memory consumption in this manner, you can try solving some previously-out-of-reach large SAT instances from past competitions https://satcompetition.github.io/

I expect you to fail, but I think attempting this and figuring out where you made a mistake will likely be educational.

gus_massa 2 years ago | |

@OP: Just as a reminder, to compute the time you must assume a single processor. You can't run 2^n operations in parallel.

johndoe0815 2 years ago |

Prove it…