On computational complexity of Clifford algebra
1.Alder, A. and Strassen, V. , “On the algorithmic complexity of associative algebras,” Theor. Comput. Sci. 15, 201 (1981).http://dx.doi.org/10.1016/0304-3975(81)90070-0
2.Bläser, M. , in STACS, Lecture Notes in Computer Science Vol. 2010, edited by Ferreira, A. and Reichel, H. (Springer, New York, 2001), pp. 99–109.
3.Budinich, M. and Budinich, P. , “A spinorial formulation of the maximum clique problem of a graph,” J. Math. Phys. 47, 043502 (2006).http://dx.doi.org/10.1063/1.2186256
4.Budinich, P. and Trautman, A. , “Fock space description of simple spinors,” J. Math. Phys. 30, 2125 (1989).http://dx.doi.org/10.1063/1.528214
5.Bürgisser, P. , Clausen, M. , and Shokrollahi, M. A. , Algebraic Complexity Theory (Springer-Verlag, Berlin, Heidelberg, 1997).
6.Chevalley, C. C. , Algebraic Theory of Spinors (Columbia University Press, New York, 1954).
7.Cohn, H. , Kleinberg, R. , Szegedy, B. , and Umans, C. , FOCS ’05: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, Washington, DC, 23–25 October 2005 (unpublished), pp. 379–388.
8.Perwass, C. , Gebken, C. , and Sommer, G. , Clifford Algebras Applications to Mathematics, Physics and Engineering, Progress in Mathematical Physics (Birkhäuser, Boston, MA, 2004), p. 34.
9.Schott, R. and Staples, G. S. , “Reductions in computational complexity using Clifford algebras,” in Advances in Applied Clifford Algebras (Birkhäuser, Boston, MA, in press).
10.Strassen, V. , “Gaussian elimination is not optimal,” Numer. Math. 13, 354 (1969).http://dx.doi.org/10.1007/BF02165411
Click to view
Multiplication table of EFB elements in Cl(1,1).
Click to view
Possible cases of products of multivectors .
No metrics data to plot.
The attempt to load metrics for this article has failed.
The attempt to plot a graph for these metrics has failed.
Article metrics loading...
Full text loading...