On computational complexity of Clifford algebra

DOI10.1063/1.3133042zbMath1187.15025arXiv0904.0417OpenAlexW3103115337MaRDI QIDQ3565282

Marco Budinich

Publication date: 3 June 2010

Published in: Journal of Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0904.0417

zbMATH Keywords

matrix algebragraph theory

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Spinor and twistor methods applied to problems in quantum theory (81R25) Clifford algebras, spinors (15A66) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (8)

On Clifford algebras and binary integers ⋮ Point particle with extrinsic curvature as a boundary of a Nambu-Goto string: classical and quantum model ⋮ On spinors transformations ⋮ On spinors of zero nullity ⋮ A theory of quantized fields based on orthogonal and symplectic Clifford algebras ⋮ The extended Fock basis of Clifford algebra ⋮ Spinorial formulations of graph problems ⋮ Generating Functions of Weighted Voting Games, MacMahon’s Partition Analysis, and Clifford Algebras

Cites Work

• Unnamed Item
• On the algorithmic complexity of associative algebras
• Gaussian elimination is not optimal
• A spinorial formulation of the maximum clique problem of a graph
• Fock space description of simple spinors

This page was built for publication: On computational complexity of Clifford algebra