/mf-aerr-sat-hamilton-graph

Development of a smt script generator to proof the satisfiability (SAT) of Hamiltonian graphs. The resolution will be proof after that using z3.

Primary LanguageSMT

Watchers