The Clifford algebra of Rn,n and the Boolean Satisfiability Problem
Abstract
We formulate a Boolean algebra in the set of idempotents of Clifford algebra Cl(Rn,n) and within this frame we examine different formulations of the Boolean Satisfiability Problem in Clifford algebra. Exploiting the isomorphism between null subspaces of Rn,n associated to simple spinors and the orthogonal group O(n) we ultimately give a continuous formulation of the Boolean Satisfiability Problem within this group that opens unexplored perspectives.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.