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.