Prune and search: Revision history

1 July 2023

• curprev 19:2319:23, 1 July 2023‎ Jarble talk contribs‎ 2,045 bytes +25‎ adding Template:Algorithmic paradigms undo

22 June 2023

• curprev 18:0118:01, 22 June 2023‎ Tc14Hd talk contribs‎ 2,020 bytes +42‎ No edit summary undo Tags: Mobile edit Mobile app edit Android app edit

18 September 2022

• curprev 06:1106:11, 18 September 2022‎ Duncan.Hull talk contribs‎ 1,978 bytes +58‎ add digital object identifiers to citations undo

14 November 2017

• curprev 22:0622:06, 14 November 2017‎ JCW-CleanerBot talk contribs‎ m 1,920 bytes −4‎ →‎top: task, replaced: SIAM J. Computing → SIAM J. Comput. using AWB undo

7 October 2017

• curprev 21:2821:28, 7 October 2017‎ Macrakis talk contribs‎ 1,924 bytes +75‎ fix link undo

19 March 2017

• curprev 08:1908:19, 19 March 2017‎ 147.46.242.171 talk‎ 1,849 bytes +1‎ algorthms -> algorithms undo

25 March 2016

• curprev 16:0016:00, 25 March 2016‎ David Eppstein talk contribs‎ m 1,848 bytes +48‎ Math formatting undo
• curprev 15:5715:57, 25 March 2016‎ David Eppstein talk contribs‎ 1,800 bytes +174‎ clarify why AB not relevant undo
• curprev 15:2715:27, 25 March 2016‎ David Eppstein talk contribs‎ 1,626 bytes −116‎ Undo mistake. "At least n^c" is very dfferent from O(n^c). undo
• curprev 15:1715:17, 25 March 2016‎ Andreaf96 talk contribs‎ m 1,742 bytes +1‎ spelling error undo
• curprev 13:5613:56, 25 March 2016‎ Andreaf96 talk contribs‎ 1,741 bytes +1‎ I merged the solution obtained with the master theorem with the more general one by Akra-Bazzi method. undo Tag: Visual edit
• curprev 13:5513:55, 25 March 2016‎ Andreaf96 talk contribs‎ 1,740 bytes 0‎ No edit summary undo
• curprev 13:5413:54, 25 March 2016‎ Andreaf96 talk contribs‎ 1,740 bytes −1‎ No edit summary undo
• curprev 13:5313:53, 25 March 2016‎ Andreaf96 talk contribs‎ 1,741 bytes +248‎ No edit summary undo
• curprev 12:0012:00, 25 March 2016‎ Andreaf96 talk contribs‎ 1,493 bytes +2‎ Undid revision 711802187 by David Eppstein (talk) undo
• curprev 12:0012:00, 25 March 2016‎ Andreaf96 talk contribs‎ 1,491 bytes −135‎ Undid revision 711804059 by David Eppstein (talk) undo
• curprev 00:2300:23, 25 March 2016‎ David Eppstein talk contribs‎ 1,626 bytes +135‎ master theorem; more careful assumptions undo
• curprev 00:0900:09, 25 March 2016‎ David Eppstein talk contribs‎ 1,491 bytes −2‎ The right way to solve this is as a geometric series. Why invoke messy solutions to complicated types of recurrence when this one is so simple? undo

24 March 2016

• curprev 23:1323:13, 24 March 2016‎ Andreaf96 talk contribs‎ 1,493 bytes +2‎ Added absolute value. undo Tag: Visual edit
• curprev 23:1023:10, 24 March 2016‎ Andreaf96 talk contribs‎ 1,491 bytes +1‎ added a comma after a formula. undo
• curprev 23:0423:04, 24 March 2016‎ Andreaf96 talk contribs‎ 1,490 bytes −1‎ This result may be achieved in some other way, but the Master theorem can not be applied without knowing S(n), the Akra-Bazzi method can, put a general formula with only the assumption stated. undo Tag: Visual edit
• curprev 22:5622:56, 24 March 2016‎ David Eppstein talk contribs‎ 1,491 bytes +92‎ Undid revision 711793248 by Andreaf96 (talk) unjustified credit to a 1998 paper for a technique known far earlier than that undo
• curprev 22:5022:50, 24 March 2016‎ Andreaf96 talk contribs‎ 1,399 bytes −92‎ I fixed the solution of the recurrence relation, using the Akra-Bazzi method. undo Tag: Visual edit

24 August 2013

• curprev 08:2108:21, 24 August 2013‎ Nbarth talk contribs‎ 1,491 bytes +114‎ geometric series undo
• curprev 08:1708:17, 24 August 2013‎ Nbarth talk contribs‎ 1,377 bytes +70‎ Decrease and prune undo

9 March 2013

• curprev 02:3502:35, 9 March 2013‎ Hardmath talk contribs‎ m 1,307 bytes 0‎ spelling of name Nimrod undo

20 February 2013

• curprev 16:1816:18, 20 February 2013‎ Altenmann talk contribs‎ 1,307 bytes −4‎ No edit summary undo

26 September 2011

• curprev 07:0907:09, 26 September 2011‎ IlyaCk talk contribs‎ 1,311 bytes 0‎ Undid revision 431127046 by 59.167.254.2 (talk) surely constant factor p is NOT the same as input size n undo

27 May 2011

• curprev 04:3304:33, 27 May 2011‎ 59.167.254.2 talk‎ 1,311 bytes 0‎ Corrected the example to use a uniform letter. undo

25 May 2010

• curprev 20:1620:16, 25 May 2010‎ EagleFan talk contribs‎ 1,311 bytes +27‎ Repairing link to disambiguation page - You can help! undo

12 May 2010

• curprev 22:0822:08, 12 May 2010‎ 71.146.68.48 talk‎ 1,284 bytes −2‎ No edit summary undo

14 April 2010

• curprev 20:5520:55, 14 April 2010‎ Michael Hardy talk contribs‎ m 1,286 bytes −1‎ typo undo
• curprev 20:5520:55, 14 April 2010‎ Michael Hardy talk contribs‎ 1,287 bytes +16‎ italics undo
• curprev 20:5520:55, 14 April 2010‎ Michael Hardy talk contribs‎ 1,271 bytes +29‎ proper spacing undo
• curprev 20:5420:54, 14 April 2010‎ Michael Hardy talk contribs‎ 1,242 bytes +26‎ Various corrections to bring things into line with WP:MOS and WP:MOSMATH. Using an asterisk for ordinary multiplication within Tex is horribly crude. undo
• curprev 01:5801:58, 14 April 2010‎ David Eppstein talk contribs‎ 1,216 bytes +66‎ see also divide and conquer undo

8 April 2010

• curprev 03:3303:33, 8 April 2010‎ Twri talk contribs‎ 1,150 bytes −4‎ No edit summary undo
• curprev 03:3203:32, 8 April 2010‎ Twri talk contribs‎ 1,154 bytes +1,154‎ ←Created page with ''''Prune and search''' is a method of solving optimization problems suggested by Nimrod Megiddo in 1983. <ref name lp3>N. Megiddo. Linear-time algorithms for li...'