Multiplication algorithm: Revision history

4 February 2012

• curprev 20:2720:27, 4 February 2012 ClueBot NG talk contribs m 33,423 bytes −17 Reverting possible vandalism by 108.64.85.135 to version by Wbm1058. False positive? Report it. Thanks, ClueBot NG. (861566) (Bot) undo
• curprev 20:2720:27, 4 February 2012 108.64.85.135 talk 33,440 bytes +17 →Grid method undo

19 January 2012

• curprev 20:5720:57, 19 January 2012 Wbm1058 talk contribs 33,423 bytes +9 computer hardware undo

9 January 2012

• curprev 18:5618:56, 9 January 2012 Citation bot 1 talk contribs m 33,414 bytes +19 [Pu408]Add: postscript. You can use this bot yourself. Report bugs here. undo

5 January 2012

• curprev 11:1011:10, 5 January 2012 Paul August talk contribs m 33,395 bytes −21 Reverted edits by 14.139.97.73 (talk) to last version by Dmcq undo
• curprev 09:0109:01, 5 January 2012 14.139.97.73 talk 33,416 bytes +21 No edit summary undo

22 December 2011

• curprev 17:1817:18, 22 December 2011 Dmcq talk contribs 33,395 bytes −122 Reverted 1 edit by 93.118.212.93 (talk): Remove incoherent statement, perhaps try and fix on talk page? (TW) undo
• curprev 16:1216:12, 22 December 2011 93.118.212.93 talk 33,517 bytes +122 →Linear time multiplication undo

17 December 2011

• curprev 14:5414:54, 17 December 2011 Dcoetzee talk contribs 33,395 bytes +78 →Fourier transform methods: Clarify: Base 10 is used in place of base 2^''w'' for illustrative purposes. undo
• curprev 13:1613:16, 17 December 2011 Dcoetzee talk contribs m 33,317 bytes 0 →Fourier transform methods: Caps undo
• curprev 13:1513:15, 17 December 2011 Dcoetzee talk contribs 33,317 bytes +7 →Fourier transform methods: Add acronym since it's used in the diagram undo
• curprev 12:5212:52, 17 December 2011 Dcoetzee talk contribs 33,310 bytes +1 →Fourier transform methods undo
• curprev 12:5112:51, 17 December 2011 Dcoetzee talk contribs 33,309 bytes +249 →Fourier transform methods: Adding diagram: thumb|350px|Demonstration of multiplying 1234 × 5678 = 7006652 using an FFT-based algorithm. [[Number-theoretic transforms in the integers modulo 337 are undo
• curprev 07:4207:42, 17 December 2011 Dcoetzee talk contribs 33,060 bytes +75 →Fourier transform methods: Remove "FFT-based algorithms multiply polynomials, not numbers. But [...]" - add a briefer explanation in context undo

30 November 2011

• curprev 07:5307:53, 30 November 2011 Samironpaul talk contribs m 32,985 bytes +56 →Shift and add undo

16 November 2011

• curprev 18:0818:08, 16 November 2011 Dmcq talk contribs 32,929 bytes −42 Reverted 1 edit by 2.124.109.179 (talk): The article is not a forum. (TW) undo
• curprev 15:3615:36, 16 November 2011 2.124.109.179 talk 32,971 bytes +42 No edit summary undo

10 November 2011

• curprev 21:5321:53, 10 November 2011 87.252.227.84 talk 32,929 bytes +125 →Fourier transform methods undo
• curprev 21:4821:48, 10 November 2011 87.252.227.84 talk 32,804 bytes −41 →Fourier transform methods undo
• curprev 21:4321:43, 10 November 2011 87.252.227.84 talk 32,845 bytes +113 →Fourier transform methods undo

2 November 2011

• curprev 02:4102:41, 2 November 2011 Dcoetzee talk contribs 32,732 bytes −16 Revert - this technique has many acceptable names, peasant multiplication is one of them and it's unambiguous undo
• curprev 00:3600:36, 2 November 2011 184.167.40.219 talk 32,748 bytes +16 →Peasant or binary multiplication undo

1 November 2011

• curprev 16:4916:49, 1 November 2011 Dmcq talk contribs 32,732 bytes +10 Reverted 1 edit by 117.196.228.27 (talk): Revert test edit. (TW) undo
• curprev 16:4416:44, 1 November 2011 117.196.228.27 talk 32,722 bytes −10 →Long multiplication undo

31 October 2011

• curprev 10:1410:14, 31 October 2011 Yunshui talk contribs m 32,732 bytes −32 Reverted edits by 122.176.236.196 (talk) to last version by Lavaka undo
• curprev 10:1410:14, 31 October 2011 122.176.236.196 talk 32,764 bytes +32 →Space complexity undo Tag: repeating characters

28 October 2011

• curprev 15:1715:17, 28 October 2011 Lavaka talk contribs 32,732 bytes +51 →See also: adding link to Horner scheme for evaluating a polynomial undo
• curprev 00:5000:50, 28 October 2011 Dcoetzee talk contribs 32,681 bytes −284 →Fourier transform methods: Move applications to Schonhage-Strassen article - and remove claim that multitape makes them impractical (actually RAM is more powerful than multitape, it's the constant factors that make them impractical) undo

26 October 2011

• curprev 21:3521:35, 26 October 2011 ClueBot NG talk contribs m 32,965 bytes −60 Reverting possible vandalism by 69.126.151.212 to version by Jheald. False positive? Report it. Thanks, ClueBot NG. (681382) (Bot) undo
• curprev 21:3421:34, 26 October 2011 69.126.151.212 talk 33,025 bytes +60 →Example undo Tag: repeating characters

26 August 2011

• curprev 09:4809:48, 26 August 2011 Jheald talk contribs m 32,965 bytes +4 →Grid method: wfy author undo

25 August 2011

• curprev 17:4117:41, 25 August 2011 Jheald talk contribs m 32,961 bytes +88 →Grid method: the addition may either be in a single sum, or via forming row-by-row totals undo
• curprev 17:3817:38, 25 August 2011 Jheald talk contribs m 32,873 bytes +15 →Long multiplication: add "larger numbers" -- for smaller numbers, one might use short multiplication or grid multiplication undo
• curprev 17:3217:32, 25 August 2011 Jheald talk contribs m 32,858 bytes −3 →Grid method undo
• curprev 17:3117:31, 25 August 2011 Jheald talk contribs m 32,861 bytes +15 →Grid method undo
• curprev 17:3017:30, 25 August 2011 Jheald talk contribs m 32,846 bytes −2 →Grid method undo
• curprev 15:0515:05, 25 August 2011 Jheald talk contribs 32,848 bytes +78 →Grid method: + the addition sum, as a box floating to the right undo
• curprev 14:5514:55, 25 August 2011 Jheald talk contribs m 32,770 bytes 0 →Grid method undo
• curprev 14:5414:54, 25 August 2011 Jheald talk contribs m 32,770 bytes +9 →Grid method undo
• curprev 14:5314:53, 25 August 2011 Jheald talk contribs 32,761 bytes +1,801 + Grid method -- usually presented earlier than traditional long multiplication (which may in some places not be taught at all), so appropriate to place higher up the article. undo

16 August 2011

• curprev 14:1714:17, 16 August 2011 Lukeus Maximus talk contribs m 30,960 bytes +3 →Karatsuba multiplication undo

13 August 2011

• curprev 19:1619:16, 13 August 2011 Dmcq talk contribs m 30,957 bytes −17 Reverted 1 edit by 67.243.35.98 (talk) identified as vandalism to last revision by Ronhjones. (TW) undo
• curprev 18:0018:00, 13 August 2011 67.243.35.98 talk 30,974 bytes +17 →Example undo

8 August 2011

• curprev 19:4919:49, 8 August 2011 Ronhjones talk contribs m 30,957 bytes +2,178 Reverted edits by 70.235.85.167 (talk) unexplained removal of content (HG) undo
• curprev 19:4819:48, 8 August 2011 70.235.85.167 talk 28,779 bytes −2,178 →Space complexity undo

1 July 2011

• curprev 05:1805:18, 1 July 2011 Racklever talk contribs 30,957 bytes +272 Add box method undo

21 June 2011

• curprev 14:1914:19, 21 June 2011 Tea2min talk contribs 30,685 bytes −1 →Example: Remove stray character undo

11 June 2011

• curprev 17:0917:09, 11 June 2011 Dmcq talk contribs 30,686 bytes +1 External links shouldn't be inline, seem quite reasonable content so I'll move to end undo
• curprev 17:0317:03, 11 June 2011 Dmcq talk contribs 30,685 bytes −383 Reverted 1 edit by 41.136.230.202 (talk): Don't see this user written program adds anything to the article. (TW) undo
• curprev 15:0115:01, 11 June 2011 41.136.230.202 talk 31,068 bytes +383 Sample implementation using bit shifting undo