Reductions in computational complexity using Clifford algebras
type: Item
instance of: scholarly article
title: Reductions in computational complexity using Clifford algebras
zbMATH Open document ID: 1191.68335
author: R. Schott
author: G. S. Staples
published in: Advances in Applied Clifford Algebras
publication date: 2010-04-20T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 60B99
Mathematics Subject Classification ID: 81P68
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5695456
zbMATH Keywords: Hamiltonian cycles
zbMATH Keywords: travelling salesman problem
zbMATH Keywords: longest path
zbMATH Keywords: NP-hard
zbMATH Keywords: NP-complete
zbMATH Keywords: cycle cover
zbMATH Keywords: set packing problem
zbMATH Keywords: set covering problem
zbMATH Keywords: matrix permanent
zbMATH Keywords: quantum computing
describes a project that uses: CLIFFORD
describes a project that uses: Gaigen
describes a project that uses: Cliffosor
MaRDI profile type: Publication
full work available at URL: s00006-008-0143-2
OpenAlex ID: W2006475368
DOI: 10.1007/S00006-008-0143-2
description: scientific article; zbMATH DE number 5695456