Reductions in computational complexity using Clifford algebras (Q964729): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Cliffosor / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00006-008-0143-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2006475368 / rank | |||
Normal rank | |||
Latest revision as of 03:05, 20 March 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
