Category:ApCoCoA-1:Package sat: Difference between revisions
From ApCoCoAWiki
No edit summary |
No edit summary |
||
Line 1: | Line 1: | ||
The basic idea behind this package is to make SAT-Solver, like (Crypto-)MiniSat, usable in/with ApCoCoA. | The basic idea behind this package is to make SAT-Solver, like (Crypto-)MiniSat, usable in/with ApCoCoA. | ||
This package allows to solve polynomial systems over GF(2) by first converting the system to CNF-SAT in DIMACS format and then using a SAT Solver to solve the resulting conjunctive normal form. | This package allows to solve polynomial systems over GF(2) by first converting the system to CNF-SAT in DIMACS format and then using a SAT-Solver to solve the resulting conjunctive normal form. | ||
{{ApCoCoAServer}} | {{ApCoCoAServer}} | ||
Line 9: | Line 9: | ||
For further informations see the following links: | For further informations see the following links: | ||
MiniSat [http://www.minisat.se] | MiniSat [http://www.minisat.se], | ||
CryptoMiniSat [http://planete.inrialpes.fr/~soos/CryptoMiniSat/index.html], | |||
CryptoMiniSat [http://planete.inrialpes.fr/~soos/CryptoMiniSat/index.html] | DIMACS [http://dimacs.rutgers.edu/] | ||
[[Category:ApCoCoA_Manual]] | [[Category:ApCoCoA_Manual]] |
Revision as of 12:54, 12 October 2009
The basic idea behind this package is to make SAT-Solver, like (Crypto-)MiniSat, usable in/with ApCoCoA.
This package allows to solve polynomial systems over GF(2) by first converting the system to CNF-SAT in DIMACS format and then using a SAT-Solver to solve the resulting conjunctive normal form.
Please note: The function(s) explained on this page is/are using the ApCoCoAServer. You will have to start the ApCoCoAServer in order to use it/them.
Important: The MiniSat executable must be in the ApCoCoA directory/sat/bin and you must have the permissions to read and write in this directory.
For further informations see the following links:
Pages in category "ApCoCoA-1:Package sat"
The following 6 pages are in this category, out of 6 total.