ALGORITMA KUANTUM UNTUK FAKTORISASI BILANGAN
<b>Abstrak :</b><p align=\"justify\"> <br /> Shoes algorithm for factoring numbers on a hypothetical quantum computer is reviewed. The quantum algorithm is said to be efficient, i.e. it is a polynomial-time algorithm, as opposed to the exponential-time algorithms o...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/4898 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |