Timeline for Best Upper Bounds on SAT
Current License: CC BY-SA 2.5
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:32 | history | edited | CommunityBot |
replaced http://cstheory.stackexchange.com/ with https://cstheory.stackexchange.com/
|
|
| Apr 7, 2011 at 7:55 | comment | added | Mikolas | I'm not sure if I would recommend sat4J, not only it is significantly slower than the state-of-the-art but also somewhat more complex. It is true, however, that it is nicely customizable due to the object-oriented structure. MiniSat is very nicely written and 2.2 is state-of-the-art. | |
| S Mar 21, 2011 at 20:38 | history | post merged (destination) | |||
| Sep 28, 2010 at 2:52 | comment | added | Suresh Venkat | we're glad that you do :) | |
| Sep 27, 2010 at 14:59 | comment | added | Dave Clarke | This is evidence that I spend too much time here ;-) | |
| Sep 27, 2010 at 14:55 | comment | added | Daniel Apon | Turns out this question was already asked before; I just didn't see it when I searched the website. Tian Liu's response on the upper bounds question is exactly what I was looking for. Thanks for the links, dave! | |
| Sep 27, 2010 at 14:54 | vote | accept | Daniel Apon | ||
| S Mar 21, 2011 at 20:38 | |||||
| Sep 27, 2010 at 14:51 | history | answered | Dave Clarke | CC BY-SA 2.5 |