Time hierarchy theorem: Revision history

Filter revisionsshowhide

To date:

Tag filter:

Invert selection

External tools:

For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

curprev 11:5011:50, 31 July 2007 DcoetzeeBot~enwiki talk contribs m 8,702 bytes −15 Robot-assisted disambiguation: Complexity classes P and NP undo

curprev 12:3712:37, 9 February 2007 A.bit talk contribs m 8,717 bytes +1 ←Reverted revision 106810185 by A.bit (talk) via undo - misread something undo
curprev 10:5610:56, 9 February 2007 A.bit talk contribs m 8,716 bytes −1 →Statement: 2x worst case? does not seem to make sense undo

curprev 20:1320:13, 6 February 2007 SmackBot talk contribs m 8,717 bytes +19 Date/fix maintenance tags undo

curprev 23:1923:19, 30 August 2006 SmackBot talk contribs m 8,698 bytes −10 ISBN formatting &/or general fixes using AWB undo

curprev 16:2416:24, 24 May 2006 Theone256 talk contribs 8,708 bytes +81 →Statement: latex formulas undo
curprev 16:0616:06, 24 May 2006 Theone256 talk contribs m 8,627 bytes +30 →Background: more beautiful formulas (<math>mode) undo

curprev 02:2602:26, 13 May 2006 Freakofnurture talk contribs m 8,597 bytes −11 Reverted edits by Cydebot (talk) to last version by Creidieki undo

curprev 17:2517:25, 12 May 2006 Cydebot talk contribs m 8,608 bytes +11 Robot - Bypassing citation needed redirect. undo

curprev 22:3422:34, 23 April 2006 Creidieki talk contribs 8,597 bytes +331 +proof overview undo

curprev 23:2923:29, 20 April 2006 Creidieki talk contribs 8,266 bytes +131 Add statement that similar theorems are not known for probabilistic time or for quantum time (reference is from Rudich complexity book, don't have it with me) undo

curprev 23:0923:09, 19 April 2006 72.58.19.66 talk 8,135 bytes 0 →Proof: period undo

curprev 09:2709:27, 26 February 2006 That Guy, From That Show! talk contribs 8,135 bytes −10 migrate {{book reference}} to {{cite book}} using AWB undo

curprev 22:0522:05, 27 December 2005 BeteNoir talk contribs m 8,145 bytes +13 No edit summary undo

curprev 22:3822:38, 19 November 2005 Dcoetzee talk contribs 8,132 bytes +217 →References: Add Stephen Cook paper undo
curprev 22:3222:32, 19 November 2005 Dcoetzee talk contribs 7,915 bytes +481 Add references undo

curprev 15:5315:53, 3 October 2005 Timwi talk contribs 7,434 bytes +121 →Statement: little note, suggested on talk page undo
curprev 15:0015:00, 3 October 2005 Timwi talk contribs 7,313 bytes −1,571 An anonymous user replaced the entire proof with one which I (personally) find less clear and which uses notation without defining it. Hence, revert. Please discuss on talk page if you disagree. undo
curprev 04:3404:34, 3 October 2005 68.43.123.201 talk 8,884 bytes +4 No edit summary undo
curprev 04:3204:32, 3 October 2005 68.43.123.201 talk 8,880 bytes +1,567 Full proof given, corollaries listed undo

curprev 16:3816:38, 29 June 2005 Dcoetzee talk contribs 7,313 bytes +3 →Statement: Statement is no longer correct; it must be little o of f(n)/log f(n), not big O undo
curprev 07:4607:46, 29 June 2005 Timwi talk contribs m 7,310 bytes +29 →Statement: change t(n) to f(n) since the rest of the article uses that undo

curprev 16:5516:55, 28 June 2005 Dcoetzee talk contribs 7,281 bytes −12 →Statement: Fix example to match restatement undo
curprev 16:5316:53, 28 June 2005 Dcoetzee talk contribs 7,293 bytes −23 →Statement: Oops, wording undo
curprev 16:5216:52, 28 June 2005 Dcoetzee talk contribs 7,316 bytes −109 →Statement: Oops, sorry on the n thing - simplify the second statement undo
curprev 11:0811:08, 28 June 2005 Timwi talk contribs 7,425 bytes −9 no, you don't need the "at least n" criterion. undo

curprev 20:5020:50, 26 June 2005 Dcoetzee talk contribs 7,434 bytes +22 →Statement: and is at least ''n'' (I think we need this assumption) undo

curprev 21:2221:22, 25 June 2005 Dcoetzee talk contribs 7,412 bytes +300 →Consequences: P does not collapse undo
curprev 21:0021:00, 25 June 2005 Dcoetzee talk contribs m 7,112 bytes +3 Plural undo
curprev 21:0021:00, 25 June 2005 Dcoetzee talk contribs 7,109 bytes −1 equivalent -> analogous (my bad) undo
curprev 20:5620:56, 25 June 2005 Dcoetzee talk contribs 7,110 bytes +803 Stronger statement, consequence for exponents of problems in P undo

curprev 19:0019:00, 29 May 2005 Dcoetzee talk contribs 6,307 bytes +110 Add a bit of explanation undo

curprev 16:5416:54, 13 March 2005 CryptoDerk talk contribs m 6,197 bytes +23 fix link undo

curprev 08:1508:15, 20 November 2004 Dcoetzee talk contribs 6,174 bytes 0 Categories to end undo

curprev 12:2512:25, 4 October 2004 Timwi talk contribs 6,174 bytes +27 →Extension: Include the information from the talk page undo

curprev 13:3913:39, 29 September 2004 Timwi talk contribs 6,147 bytes +64 →Consequences: rephrase undo

curprev 20:4620:46, 28 September 2004 128.112.49.106 talk 6,083 bytes +4 →Proof undo

curprev 23:4823:48, 4 July 2004 Gdr talk contribs m 6,079 bytes −2 Link time-constructible function undo
curprev 23:4523:45, 4 July 2004 Gdr talk contribs 6,081 bytes +371 More consequences. undo

curprev 15:2415:24, 1 June 2004 Andris talk contribs 5,710 bytes +14 changed category to Category:Computational complexity theory undo
curprev 12:3312:33, 1 June 2004 24.60.180.59 talk 5,696 bytes −4 No edit summary undo

curprev 13:0613:06, 18 May 2004 Gdr talk contribs m 5,700 bytes +10 =Statement= link undo

curprev 14:5014:50, 16 May 2004 Charles Matthews talk contribs m 5,690 bytes +4 =Non-deterministic time hierarchy theorem= lk undo

curprev 03:3103:31, 13 April 2004 Populus talk contribs m 5,686 bytes −3 sp undo

curprev 00:1600:16, 23 March 2004 Robbot talk contribs m 5,689 bytes +23 Andre Engels - Robot-assisted disambiguation: Function undo

curprev 19:3819:38, 3 March 2004 Timwi talk contribs m 5,666 bytes +4 No edit summary undo
curprev 19:3619:36, 3 March 2004 Timwi talk contribs 5,662 bytes +53 consequences section undo
curprev 19:3419:34, 3 March 2004 Timwi talk contribs 5,609 bytes +3,744 THE PROOF! ... please proofread and everything! undo

curprev 03:4203:42, 20 February 2003 AxelBoldt talk contribs 1,865 bytes −95 removing my bogus comment undo

curprev 23:0823:08, 16 February 2003 AxelBoldt talk contribs 1,960 bytes +1,960 No edit summary

Time hierarchy theorem: Revision history

31 July 2007

9 February 2007

6 February 2007

30 August 2006

24 May 2006

13 May 2006

12 May 2006

23 April 2006

20 April 2006

19 April 2006

26 February 2006

27 December 2005

19 November 2005

3 October 2005

29 June 2005

28 June 2005

26 June 2005

25 June 2005

29 May 2005

13 March 2005

20 November 2004

4 October 2004

29 September 2004

28 September 2004

4 July 2004

1 June 2004

18 May 2004

16 May 2004

13 April 2004

23 March 2004

3 March 2004

20 February 2003

16 February 2003