Refines SAT formulation in Clifford algebra Cl(R^{n,n}) and outlines a polynomial-time unsatisfiability test using simple spinors.
The Boolean SATisfiability Problem in Clifford algebra
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.
fields
math-ph 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
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.