Jump to content

Computational hardness assumption: Revision history


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

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)

20 December 2023

9 December 2023

4 December 2023

22 September 2023

9 September 2023

27 August 2023

22 August 2023

24 July 2023

1 June 2023

15 March 2023

14 November 2022

11 November 2021

10 November 2021

22 August 2021

26 March 2021

9 December 2020

10 November 2020

1 September 2020

5 August 2020

28 June 2020

10 May 2020

29 January 2020

13 October 2019

1 October 2019

5 September 2019

19 July 2019

12 July 2019

8 July 2019

1 July 2019

19 June 2019

17 March 2019

19 February 2019

  • curprev 13:0113:01, 19 February 201980.217.180.245 talk 26,085 bytes −6 Clarified that it is unlikely for any algorithmic designer to come up with an algorithm that refutes a well-studied computational hardness assumption such as P versus NP problem. undo

8 February 2019

11 December 2018

19 November 2018

18 October 2018

12 August 2018

15 May 2018

9 May 2018

6 May 2018

13 April 2018

10 December 2017

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)