HN Explorer

sat_solver

↗ HN profile [ 122 ms ] full profile
Karma
0
Created
()
Submissions
0
  1. I solved SAT (boolean satisfiability), what now?

    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…

    1 points 4