In this talk I will present some complex, NP-complete problems, formulated in Clifford (spinor) Algebra. I will show that typically these problems require only a polynomial number of Clifford multiplications. I will then treat briefly the computational complexity of Clifford operations. Subsequently I will present some results for Clifford algebras in arbitrary dimension that allow to better tackle the initial formulation of the complex problems.
Go to day