Groverov algoritam (Serbian Wikipedia)
Analysis of information sources in references of the Wikipedia article "Groverov algoritam" in Serbian language version.
refsWebsite
Global rank
Serbian rank
11th place
23rd place
580th place
551st place
18th place
28th place
arxiv.org
- Michel Boyer; Gilles Brassard; Peter Høyer; Alain Tapp (1998), „Tight Bounds on Quantum Searching”, Fortsch. Phys., 46 (4–5): 493—506, Bibcode:1998ForPh..46..493B, S2CID 10032711, arXiv:quant-ph/9605034
, doi:10.1002/(SICI)1521-3978(199806)46:4/5<493::AID-PROP493>3.0.CO;2-P - Andris Ambainis (2004), „Quantum search algorithms”, SIGACT News, 35 (2): 22—35, S2CID 11326499, arXiv:quant-ph/0504012 , doi:10.1145/992287.992296
- Grover, Lov K.; Radhakrishnan, Jaikumar (2004). „quant-ph/0407122”. arXiv:quant-ph/0407122 .
berkeley.edu
cs.berkeley.edu
- Bennett C.H., Bernstein E., Brassard G., Vazirani U., The strengths and weaknesses of quantum computation. SIAM Journal on Computing . 26 (5): 1510—1523 http://www.cs.berkeley.edu/~vazirani/pubs/bbbv.ps. Недостаје или је празан параметар
|title=(помоћ) (1997). Shows the optimality of Grover's algorithm.
doi.org
- Michel Boyer; Gilles Brassard; Peter Høyer; Alain Tapp (1998), „Tight Bounds on Quantum Searching”, Fortsch. Phys., 46 (4–5): 493—506, Bibcode:1998ForPh..46..493B, S2CID 10032711, arXiv:quant-ph/9605034 , doi:10.1002/(SICI)1521-3978(199806)46:4/5<493::AID-PROP493>3.0.CO;2-P
- Andris Ambainis (2004), „Quantum search algorithms”, SIGACT News, 35 (2): 22—35, S2CID 11326499, arXiv:quant-ph/0504012 , doi:10.1145/992287.992296
harvard.edu
adsabs.harvard.edu
- Michel Boyer; Gilles Brassard; Peter Høyer; Alain Tapp (1998), „Tight Bounds on Quantum Searching”, Fortsch. Phys., 46 (4–5): 493—506, Bibcode:1998ForPh..46..493B, S2CID 10032711, arXiv:quant-ph/9605034 , doi:10.1002/(SICI)1521-3978(199806)46:4/5<493::AID-PROP493>3.0.CO;2-P
semanticscholar.org
api.semanticscholar.org
- Michel Boyer; Gilles Brassard; Peter Høyer; Alain Tapp (1998), „Tight Bounds on Quantum Searching”, Fortsch. Phys., 46 (4–5): 493—506, Bibcode:1998ForPh..46..493B, S2CID 10032711, arXiv:quant-ph/9605034 , doi:10.1002/(SICI)1521-3978(199806)46:4/5<493::AID-PROP493>3.0.CO;2-P
- Andris Ambainis (2004), „Quantum search algorithms”, SIGACT News, 35 (2): 22—35, S2CID 11326499, arXiv:quant-ph/0504012 , doi:10.1145/992287.992296