Reductions in computational complexity using Clifford algebras (Q964729)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Reductions in computational complexity using Clifford algebras |
scientific article; zbMATH DE number 5695456
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reductions in computational complexity using Clifford algebras |
scientific article; zbMATH DE number 5695456 |
Statements
Reductions in computational complexity using Clifford algebras (English)
0 references
20 April 2010
0 references
Hamiltonian cycles
0 references
travelling salesman problem
0 references
longest path
0 references
NP-hard
0 references
NP-complete
0 references
cycle cover
0 references
set packing problem
0 references
set covering problem
0 references
matrix permanent
0 references
quantum computing
0 references
