The Boolean SATisfiability Problem in Clifford algebra
classification
🧮 math-ph
cs.CCmath.MP
keywords
booleanproblemsatisfiabilityunsatisfiabilityalgebraalgorithmallowsclifford
read the original 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.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
A Satisfiability algorithm based on Simple Spinors of the Clifford algebra of $\mathbb{R}^{n,n}$
Refines SAT formulation in Clifford algebra Cl(R^{n,n}) and outlines a polynomial-time unsatisfiability test using simple spinors.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.