2000 character limit reached
The Clifford algebra of $R^{n,n}$ and the Boolean Satisfiability Problem
Published 5 Mar 2021 in math-ph and math.MP | (2103.03623v1)
Abstract: We formulate a Boolean algebra in the set of idempotents of Clifford algebra Cl($R{n,n}$) and within this frame we examine different formulations of the Boolean Satisfiability Problem in Clifford algebra. Exploiting the isomorphism between null subspaces of $R{n,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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.