impact:

Memcomputing NP-complete problems in polynomial time using polynomial resources and collective states

According to PR-model, Memcomputing NP-complete problems in polynomial time using polynomial resources and collective states is ranked 118,001st in multilingual Wikipedia, in particular this website is ranked 3,486th in Russian Wikipedia.

#Language
PR-model F-model AR-model
118,001st place
1,137,139th place
249,981st place
3,486th place
55,408th place
3,894th place
kkKazakh
147th place
586th place
204th place