Reductions in computational complexity using Clifford algebras (Q964729)

From MaRDI portal
Revision as of 03:05, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    20 April 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    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
    0 references
    0 references
    0 references
    0 references