Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
Articolo
Articolo
A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time by at most a polynomial ...
Idioma Inglés
Página del recurso disponiblePágina de referencia del recurso. El texto completo no está confirmado automáticamente.
Página del recurso