Zobrazeno 1 - 10
of 1 288
pro vyhledávání: '"Clique problems"'
The clique problems, including $k$-CLIQUE and Triangle Finding, form an important class of computational problems; the former is an NP-complete problem, while the latter directly gives lower bounds for Matrix Multiplication. A number of previous effo
Externí odkaz:
http://arxiv.org/abs/2308.16827
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Quantum annealing has the potential to find low energy solutions of NP-hard problems that can be expressed as quadratic unconstrained binary optimization problems. However, the hardware of the quantum annealer manufactured by D-Wave Systems, which we
Externí odkaz:
http://arxiv.org/abs/2205.12165
Publikováno v:
In Procedia Computer Science 2023 223:275-282
Semidefinite programs (SDPs) can be solved in polynomial time by interior point methods. However, when the dimension of the problem gets large, interior point methods become impractical in terms of both computational time and memory requirements. Cer
Externí odkaz:
http://arxiv.org/abs/2106.12411
Autor:
Pelofske, Elijah1 (AUTHOR) epelofske@lanl.gov, Hahn, Georg2 (AUTHOR), Djidjev, Hristo N.1,3 (AUTHOR)
Publikováno v:
Quantum Information Processing. May2023, Vol. 22 Issue 5, p1-22. 22p.
Autor:
Galay, Roman, Kalistratov, Daniil
As it follows from G\"odel's incompleteness theorems, any consistent formal system of axioms and rules of inference should imply a true unprovable statement. Actually, this fundamental principle can be efficiently applicable in computational mathemat
Externí odkaz:
http://arxiv.org/abs/1905.08033
Publikováno v:
Quantum Technology and Optimization Problems (QTOP 2019), Munich, Germany, March 18, 2019
Commercial quantum annealers from D-Wave Systems can find high quality solutions of quadratic unconstrained binary optimization problems that can be embedded onto its hardware. However, even though such devices currently offer up to 2048 qubits, due
Externí odkaz:
http://arxiv.org/abs/1901.07657
Since its first use by Euler on the problem of the seven bridges of K\"onigsberg, graph theory has shown excellent abilities in solving and unveiling the properties of multiple discrete optimization problems. The study of the structure of some intege
Externí odkaz:
http://arxiv.org/abs/1808.07102
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.