Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Hendrik Künnemann"'
Autor:
Hendrik Künnemann, Frank Phillipson
Publikováno v:
Mathematics, Vol 11, Iss 12, p 2741 (2023)
The problem of finding the maximum weighted cycle in a directed graph map to solve optimization problems is NP-hard, implying that approaches in classical computing are inefficient. Here, Quantum computing might be a promising alternative. Many curre
Externí odkaz:
https://doaj.org/article/826598cfb9434815af7066928abd2248
Autor:
Phillipson, Hendrik Künnemann, Frank
Publikováno v:
Mathematics; Volume 11; Issue 12; Pages: 2741
The problem of finding the maximum weighted cycle in a directed graph map to solve optimization problems is NP-hard, implying that approaches in classical computing are inefficient. Here, Quantum computing might be a promising alternative. Many curre
Autor:
Hendrik Künnemann, Frank Phillipson
Publikováno v:
SSRN Electronic Journal.