Probabilistic algorithms for sparse polynomials

Multilingual Wikipedia

In June 2020 the work Probabilistic algorithms for sparse polynomials was on the 683,787th place in the ranking of the most reliable and popular publications with DOI number in multilingual Wikipedia from readers' point of view (PR-score). If we consider only frequency of appearance of this source in references of Wikipedia articles (F-score), this work was on the 1,211,712th place in June 2020. From Wikipedians' point of view, "Probabilistic algorithms for sparse polynomials" is the 1,088,606th most reliable publication with DOI number in different language versions of Wikipedia (AR-score).

PR-score:
683,787th place
1,600
+750
AR-score:
1,088,606th place
50
0
F-score:
1,211,712th place
1
0

Russian Wikipedia (ru)

PR-score:
26,464th place
1,600
+750
AR-score:
46,495th place
50
0
F-score:
65,062nd place
1
0

BestRef shows popularity and reliability scores for sources in references of Wikipedia articles in different languages. Data extraction based on complex method using Wikimedia dumps. To find the most popular and reliable sources we used information about over 200 million references of Wikipedia articles. More details...