Designing SAT for HCP

What this record says

For arbitrary undirected graph $G$, we are designing SATISFIABILITY problem (SAT) for HCP, using tools of Boolean algebra only. The

CATALOG · The abstract is indexed.