Computational complexity reductions using Clifford algebras

DOI10.1007/978-1-84996-108-0_20MaRDI QIDQ3060697zbMATH OpenOpenAlexFDO

Authors R. Schott, G. S. Staples

Publication date 8 December 2010

Published in Geometric Algebra Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-1-84996-108-0_20

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Reductions in computational complexity using Clifford algebras
• On computational complexity of Clifford algebra
• Clifford algebras, random graphs, and quantum random variables
• Clifford algebras meet tree decompositions
• On the Complexity of Cycle Enumeration for Simple Graphs

Cited in

(8)

• Clifford algebras meet tree decompositions
• Quantum computing based on complex Clifford algebras
• Clifford algebras, random graphs, and quantum random variables
• On computational complexity of Clifford algebra
• Spinorial formulations of graph problems
• Clifford algebras meet tree decompositions
• Clifford algebra method for network expression, computation, and algorithm construction
• Reductions in computational complexity using Clifford algebras

Describes a project that uses

Uses Software

• Mathematica

This page was built for publication: Computational complexity reductions using Clifford algebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3060697)