Timeline for Small hard 3-SAT instances
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 16, 2016 at 0:21 | comment | added | SamTheTomato | Yes... I suppose what I mean is non-trivial instead of hard. For example, given a 15 clause problem, would it take more effort to solve a problem with 3, 4, 5, 6 etc. variables? The purpose being to test small scale instances for a new algorithm and scale up later | |
| Jun 14, 2016 at 9:34 | comment | added | Raphael | Hard for what purpose? Small instance are easily brute-forced. | |
| Jun 14, 2016 at 9:34 | history | edited | Raphael |
edited tags
|
|
| Jun 14, 2016 at 5:31 | answer | added | D.W.♦ | timeline score: 2 | |
| Jun 14, 2016 at 2:27 | history | edited | SamTheTomato | CC BY-SA 3.0 |
added 55 characters in body
|
| Jun 14, 2016 at 2:01 | history | asked | SamTheTomato | CC BY-SA 3.0 |