The Boolean SATisfiability Problem in Clifford algebra
Mathematical Physics
2019-04-05 v3 Computational Complexity
math.MP
Abstract
We present a formulation of the Boolean Satisfiability Problem in spinor language that allows to give a necessary and sufficient condition for unsatisfiability. With this result we outline an algorithm to test for unsatisfiability with possibly interesting theoretical properties.
Cite
@article{arxiv.1704.02942,
title = {The Boolean SATisfiability Problem in Clifford algebra},
author = {Marco Budinich},
journal= {arXiv preprint arXiv:1704.02942},
year = {2019}
}
Comments
16 pages, better formalization and simpler proofs