4 ms·
> Even is SAT is P that doesn't imply a solution can feasibly be found. It does, because in this case you also assumed that running numerical algorithm was fea
by js8 3y ago
> Even is SAT is P that doesn't imply a solution can feasibly be found.
It does, because in this case you also assumed that running numerical algorithm was feasible. So if your SAT solver fails to find the answer, it is either suboptimal method (because numerical method exists), or (if the instance is UNSAT) the numerical method gives you a flawed result.
- constantcrying 3y agoDo you not understand that an O(n^100) algorithm is in P, but can never be run feasibly on a computer for any non trivial amounts of n? For n=10 you are already far beyond the number of Atoms in the universe. I don't think you have any clue what you are actually talking about.