Problema di Simon (Italian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Problema di Simon" in Italian language version.

refsWebsite

Global rank Italian rank

6,599^th place

low place

2^nd place

7^th place

18^th place

104^th place

69^th place

235^th place

arxiv.org (Global: 69^th place; Italian: 235^th place)

P. Koiran, V. Nesme e N. Portier, The quantum query complexity of the Abelian hidden subgroup problem (ps), in Theoretical Computer Science, vol. 380, n. 1-2, 2007, pp. 115-126, DOI:10.1016/j.tcs.2007.02.057.

P. Koiran, V. Nesme e N. Portier, The quantum query complexity of the Abelian hidden subgroup problem (ps), in Theoretical Computer Science, vol. 380, n. 1-2, 2007, pp. 115-126, DOI:10.1016/j.tcs.2007.02.057.
P. Koiran, V. Nesme e N. Portier, A quantum lower bound for the query complexity of Simon's Problem (ps), in Proc. ICALP., vol. 3580, 2005, pp. 1287-1298, Bibcode:2005quant.ph..1060K, arXiv:quant-ph/0501060.