Jump to content

Limits of computation: 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)

3 June 2024

8 May 2024

15 January 2024

9 January 2024

18 October 2023

8 October 2023

12 April 2023

28 September 2022

27 June 2022

30 January 2022

31 December 2021

24 October 2021

10 July 2021

20 June 2021

28 February 2021

3 January 2021

10 December 2020

22 November 2020

21 November 2020

31 October 2020

12 October 2020

2 July 2020

25 June 2020

26 May 2020

17 May 2020

28 February 2020

30 November 2019

24 September 2019

27 August 2019

28 July 2019

27 July 2019

  • curprev 05:0305:03, 27 July 2019 Anders Kaseorg talk contribs 9,734 bytes −574 Remove unsourced inaccurate speculation about NP-complete problems. Only the most naive algorithms scale as O(2^n), and in practice, travelling salesman instances with tens of thousands of vertices have already been solved on conventional computers. undo

20 June 2019

15 June 2019

13 April 2019

25 February 2019

22 February 2019

20 February 2019

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