Reductions in computational complexity using Clifford algebras (Q964729): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1038791 |
Changed an Item |
||
| Property / author | |||
| Property / author: George Stacey Staples / rank | |||
Normal rank | |||
Revision as of 02:03, 22 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reductions in computational complexity using Clifford algebras |
scientific article |
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
