[HTML][HTML] Prime factorization using magnonic holographic devices
Y Khivintsev, M Ranjbar, D Gutierrez… - Journal of Applied …, 2016 - pubs.aip.org
Determining the prime factors of a given number N is a problem that requires super-
polynomial time for conventional digital computers. A polynomial-time algorithm was …
polynomial time for conventional digital computers. A polynomial-time algorithm was …
[引用][C] Prime factorization using magnonic holographic devices
YV Khivintsev, M Ranjbar, D Guttierrez, H Chiang… - Journal of Applied …, 2016 - cplire.ru
Prime factorization using magnonic holographic devices - Каталог публикаций ИРЭ им. ВАКотельникова
РАН Каталог публикаций ИРЭ им. ВАКотельникова РАН Начало О репозитории Просмотр …
РАН Каталог публикаций ИРЭ им. ВАКотельникова РАН Начало О репозитории Просмотр …
Prime factorization using magnonic holographic devices
Y Khivintsev, M Ranjbar, D Gutierrez… - Journal of Applied …, 2016 - pubs.aip.org
Determining the prime factors of a given number N is a problem that requires super-
polynomial time for conventional digital computers. A polynomial-time algorithm was …
polynomial time for conventional digital computers. A polynomial-time algorithm was …
Prime factorization using magnonic holographic devices
Y Khivintsev, M Ranjbar, D Gutierrez, H Chiang… - Journal of Applied …, 2016 - cir.nii.ac.jp
抄録< jats: p> Determining the prime factors of a given number N is a problem that requires
super-polynomial time for conventional digital computers. A polynomial-time algorithm was …
super-polynomial time for conventional digital computers. A polynomial-time algorithm was …
Prime factorization using magnonic holographic devices
Y Khivintsev, M Ranjbar, D Gutierrez, H Chiang… - Journal of Applied …, 2016 - osti.gov
Determining the prime factors of a given number $ N $ is a problem that requires super-
polynomial time for conventional digital computers. A polynomial-time algorithm was …
polynomial time for conventional digital computers. A polynomial-time algorithm was …
Prime factorization using magnonic holographic devices
Y Khivintsev, M Ranjbar, D Gutierrez… - Journal of Applied …, 2016 - ui.adsabs.harvard.edu
Determining the prime factors of a given number N is a problem that requires super-
polynomial time for conventional digital computers. A polynomial-time algorithm was …
polynomial time for conventional digital computers. A polynomial-time algorithm was …
[引用][C] Prime factorization using magnonic holographic devices
Y Khivintsev, A Kozhevnikov, Y Filimonov… - Journal of Applied …, 2016 - elibrary.ru
[PDF][PDF] Prime Factorization Using Magnonic Holographic Device
Y Khivintsev, M Ranjbar, D Gutierrez, H Chiang… - academia.edu
Determining the prime factors of a given number N is a problem, which requires
superpolynomial time for conventional digital computers. A polynomial-time algorithm was …
superpolynomial time for conventional digital computers. A polynomial-time algorithm was …
Prime Factorization Using Magnonic Holographic Device
Y Khivintsev, M Ranjbar, D Gutierrez, H Chiang… - arXiv preprint arXiv …, 2016 - arxiv.org
Determining the prime factors of a given number N is a problem, which requires super-
polynomial time for conventional digital computers. A polynomial-time algorithm was …
polynomial time for conventional digital computers. A polynomial-time algorithm was …
[引用][C] Prime factorization using magnonic holographic devices
YV Khivintsev, M Ranjbar, D Guttierrez, H Chiang… - Journal of Applied …, 2016 - cplire.ru
Prime factorization using magnonic holographic devices - Каталог публикаций ИРЭ им. ВАКотельникова
РАН Каталог публикаций ИРЭ им. ВАКотельникова РАН Начало О репозитории Просмотр …
РАН Каталог публикаций ИРЭ им. ВАКотельникова РАН Начало О репозитории Просмотр …