activity
20062025
most citedA Spinorial Formulation of the Maximum Clique Problem of a Graph

12 citations · 63 across the 14 of their papers we have counts for

collaborators

14 papers

math-ph2025

A Satisfiability algorithm based on Simple Spinors of the Clifford algebra of

Marco Budinich

We refine the formulation of the Boolean satisfiability problem with Boolean variables in Clifford algebra [3] and exploit this continuous sett…

math-ph2021

The Clifford algebra of and the Boolean Satisfiability Problem

Marco Budinich

We formulate a Boolean algebra in the set of idempotents of Clifford algebra Cl() and within this frame we examine different formulations of the Boolean Satisfiability Pro…

math-ph2020★ 1 cited

On Simple Spinors, Null Vectors and the Orthogonal Group O(n)

Marco Budinich

We explore the three separate isomorphisms that link together simple spinors, null vectors and the orthogonal group O(n) and exploit them to look back at these arguments from a uni…

math.CO2019★ 2 cited

The Boolean SATisfiability Problem and the orthogonal group

Marco Budinich

We explore the relations between the Boolean Satisfiability Problem with Boolean variables and the orthogonal group $\mbox{O}(n)$. We show that all possible solutions ind…

math-ph2018★ 2 cited

On complex representations of Clifford algebra

Marco Budinich

We show that complex representations of Clifford algebra can always be reduced either to a real or to a quaternionic algebra depending on signature of complex space thus showing th…

math-ph2017★ 4 cited

The Boolean SATisfiability Problem in Clifford algebra

Marco Budinich

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…