الگوریتم کوپراسمیت–وینوگارد (Persian Wikipedia)

Analysis of information sources in references of the Wikipedia article "الگوریتم کوپراسمیت–وینوگارد" in Persian language version.

refsWebsite

Global rank Persian rank

1^st place

1,871^st place

2,119^th place

580^th place

676^th place

low place

berkeley.edu

Williams, Virginia (2011), Breaking the Coppersmith-Winograd barrier (PDF), archived from the original (PDF) on 20 January 2013, retrieved 7 December 2011.

Stothers, Andrew (2010), On the Complexity of Matrix Multiplication (PDF), archived from the original (PDF) on 15 December 2011, retrieved 7 December 2011.

Robinson, Sara (2005), "Toward an Optimal Algorithm for Matrix Multiplication" (PDF), SIAM News, 38 (9), archived from the original (PDF) on 31 March 2010, retrieved 7 December 2011

Stothers, Andrew (2010), On the Complexity of Matrix Multiplication (PDF), archived from the original (PDF) on 15 December 2011, retrieved 7 December 2011.
Williams, Virginia (2011), Breaking the Coppersmith-Winograd barrier (PDF), archived from the original (PDF) on 20 January 2013, retrieved 7 December 2011.
Robinson, Sara (2005), "Toward an Optimal Algorithm for Matrix Multiplication" (PDF), SIAM News, 38 (9), archived from the original (PDF) on 31 March 2010, retrieved 7 December 2011