Reductions in computational complexity using Clifford algebras

DOI10.1007/S00006-008-0143-2zbMath1191.68335OpenAlexW2006475368MaRDI QIDQ964729

René Schott, George Stacey Staples

Publication date: 20 April 2010

Published in: Advances in Applied Clifford Algebras (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00006-008-0143-2

zbMATH Keywords

Hamiltonian cyclesNP-hardset covering problemtravelling salesman problemNP-completequantum computinglongest pathset packing problemcycle covermatrix permanent

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Quantum computation (81P68) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Probability theory on algebraic and topological structures (60B99)

Related Items (9)

Clifford algebra as a bridge between discrete and continuous worlds ⋮ On the ternary approach to Clifford structures and Ising lattices ⋮ Doubly efficient interactive proofs over infinite and non-commutative rings ⋮ Clifford algebra multivectors and kernels for melanoma classification ⋮ A generalization of Euler's formula in Clifford algebras ⋮ Complexity of counting cycles using zeons ⋮ Clifford algebra method for network expression, computation, and algorithm construction ⋮ Support vector machine skin lesion classification in Clifford algebra subspaces. ⋮ Generating Functions of Weighted Voting Games, MacMahon’s Partition Analysis, and Clifford Algebras

Uses Software

• CLIFFORD
• Gaigen
• Cliffosor

This page was built for publication: Reductions in computational complexity using Clifford algebras