On Computational Complexity of Clifford Algebra

Details On Computational Complexity of Clifford Algebra On Computational Complexity of Clifford Algebra

2009-04-02

arxiv.org/abs/0904.0417v1

Journal of Mathematical Physics, 50 #5, 053514, 18 May 2009

Physics

Mathematical Physics

13 pages

Scientific paper

10.1063/1.3133042

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 calculations and, without resorting to the conventional matrix isomorphism formulation, obtains the same complexity. In the last part we apply these results to the Clifford algebra formulation of the NP-complete problem of the maximum clique of a graph introduced in a previous paper.

Affiliated with

Also associated with

No associations

Rating

On Computational Complexity of Clifford Algebra does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Computational Complexity of Clifford Algebra, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Computational Complexity of Clifford Algebra will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-64147