Papers
Topics
Authors
Recent
Search
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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.