Timeline for Interesting small SAT problems?
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 4, 2016 at 14:30 | comment | added | Andrew | @Juho interesting means that if I could scale it up with fancier custom hardware (bought by investors) to sizes people care about then I'd be rich :) | |
| Feb 4, 2016 at 10:55 | history | tweeted | twitter.com/StackCompSci/status/695198910265090048 | ||
| Feb 4, 2016 at 8:21 | answer | added | Juho | timeline score: 5 | |
| Feb 4, 2016 at 8:04 | answer | added | D.W.♦ | timeline score: 3 | |
| Feb 4, 2016 at 7:47 | history | edited | Raphael |
edited tags
|
|
| Feb 4, 2016 at 7:08 | comment | added | Juho | By "interesting", do you basically mean " hard to solve"? | |
| Feb 4, 2016 at 5:37 | comment | added | vzn | you want to implement the solver using FPGA gates? the bigger question is how big the solver algorithm is converted to gates... how are you converting the solving algorithm to gates? anyway, interesting project! definitely suggest dropping by Computer Science Chat. fairly simple problems easy to verify/ implement would involve integer arithmetic eg addition or subtraction. see also tseytin transform | |
| Feb 4, 2016 at 2:49 | review | First posts | |||
| Feb 4, 2016 at 3:10 | |||||
| Feb 4, 2016 at 2:46 | history | asked | Andrew | CC BY-SA 3.0 |