Timeline for Assignment to make formula unsatisfiable
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 29, 2015 at 16:03 | vote | accept | Grigor Aghanyan | ||
| May 29, 2015 at 16:00 | comment | added | Yuval Filmus | Practically speaking there could be heuristics that work well for some problems, but I'm unaware of any. The polynomial hierarchy (which contains $\Sigma_2^P$) should be covered in any textbook on computational complexity. | |
| May 29, 2015 at 15:58 | comment | added | Grigor Aghanyan | Exactly. Thank you for the answer. So the solution with $2^n$ solver calls is "not a bad solution" for it? Some link for papers about this problem will help me lot. | |
| May 29, 2015 at 15:43 | history | answered | Yuval Filmus | CC BY-SA 3.0 |