Timeline for Fast checking that a system of polynomial equations is satisfiable over $\mathbb{F}_2$
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 25 at 3:42 | comment | added | Pace Nielsen | It turns out that Mathematica has a satisfiability solver "SatisfiableQ" which works well for the problem. | |
| Feb 29 at 14:54 | comment | added | Pace Nielsen | @j.p. No idea. I'm planning to work with hundreds of polynomials in hundreds of variables. I don't expect this is too big for most systems. | |
| Feb 29 at 7:02 | comment | added | j.p. | Is your system small enough that either libFES or the crossbred algorithm implemented by Charles Bouillaguet can handle it? | |
| Feb 28 at 23:08 | comment | added | Robert Israel | Recent versions of Maple include a SAT solver based on MiniSAT. And it also has a translator from Mathematica (I don't know, however, whether your Mathematica data are in a format that translates directly to the correct format for Maple's Satisfy comand). | |
| Feb 28 at 17:42 | history | asked | Pace Nielsen | CC BY-SA 4.0 |