Related changes
Enter a page name to see changes on pages linked to or from that page. (To see members of a category, enter Category:Name of category). Changes to pages on your Watchlist are shown in bold with a green bullet. See more at Help:Related changes.
List of abbreviations (help):
- D
- Edit made at Wikidata
- r
- Edit flagged by ORES
- N
- New page
- m
- Minor edit
- b
- Bot edit
- (±123)
- Page byte size change
- Temporarily watched page
21 May 2024
- diffhist m Millennium Prize Problems 04:18 +353 LucasBrown talk contribs (→Unsolved problems) Tag: Visual edit
20 May 2024
- diffhist Birch and Swinnerton-Dyer conjecture 18:01 −4 2003:ea:b744:b069:40f:88df:5f1d:f108 talk (Removed comma splice to avoid confusion) Tags: Mobile edit Mobile web edit
19 May 2024
- diffhist Riemann hypothesis 15:41 −4 Dhrm77 talk contribs (Undid revision 1224595476 by 95.163.174.247 (talk) already linked above) Tag: Undo
- diffhist Riemann hypothesis 08:50 +4 95.163.174.247 talk Tag: Reverted
17 May 2024
- diffhist m P versus NP problem 23:48 −322 Discospinster talk contribs (Reverted edit by Nilson Bolivar (talk) to last version by Discospinster) Tag: Rollback
- diffhist m P versus NP problem 23:44 +322 Nilson Bolivar talk contribs (→Claimed solutions: The complexity of any type of problem can be from the easiest to the infinitely complex) Tag: Reverted
- diffhist m P versus NP problem 23:38 −322 Discospinster talk contribs (Reverted edits by Nilson_Bolivar (talk): unexplained content removal (HG) (3.4.12)) Tags: Huggle Rollback
- diffhist m P versus NP problem 23:37 −4,173 Nilson Bolivar talk contribs (The complexity of any type of problem can be from the easiest to the infinitely complex) Tag: Reverted
- diffhist m P versus NP problem 23:30 +4,495 Nilson Bolivar talk contribs (→Claimed solutions: The complexity of any type of problem can be from the easiest to the infinitely complex, there are problems where there are shortcuts with God's algorithms and they can be solved in polynomial time, and there are problems where with God's algorithms there are no shortcuts and no are solved in polynomial time, if a non-deterministic Turing machine finds solutions to problems in polynomial time this means that a deterministic Turing machine with God's algorithm can also fin) Tag: Reverted
- diffhist P versus NP problem 18:01 −250 David Eppstein talk contribs (Undid revision 1224322635 by Nilson Bolivar (talk) WP:REFSPAM, not reliably published, crankery) Tag: Undo