12 citations · 22 across the 2 of their papers we have counts for
Showing math-phShow all
2 papers · 1 filter
math-ph2009★ 10 cited
On Computational Complexity of Clifford Algebra
Marco Budinich
After a brief discussion of the computational complexity of Clifford algebras, we present a new basis for even Clifford algebra Cl(2m) that simplifies greatly the actual calculatio…
math-ph2006★ 12 cited
A Spinorial Formulation of the Maximum Clique Problem of a Graph
Marco Budinich, Paolo Budinich
We present a new formulation of the maximum clique problem of a graph in complex space. We start observing that the adjacency matrix A of a graph can always be written in the form…