Jump to content

NP (complexity): 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)

6 July 2024

  • curprev 18:4118:41, 6 July 2024XOR'easter talk contribs 21,006 bytes +31 reduce by 1 the number of endnotes in the intro; avoid overloading the term "problem" to mean both specific decision problems and the general P-vs-NP question undo

9 June 2024

7 May 2024

9 November 2023

27 September 2023

18 August 2023

15 August 2023

6 June 2023

  • curprev 21:4221:42, 6 June 2023Yehuling talk contribsm 20,979 bytes +86 fixed a typo – the start of the second paragraph previously said NP is class of problems verifiable in poly time on a non-deterministic Turing Machine (with a link) which is misleading – the definition is verifiable in poly time on a deterministic TM. So I edited that and made the writing clearer to the reader by adding bullet points so the differences between the definitions can be easily seen. undo Tag: Visual edit

29 April 2023

15 March 2023

1 March 2023

28 February 2023

2 November 2022

3 October 2022

7 August 2022

3 July 2022

28 May 2022

20 May 2022

9 May 2022

6 April 2022

5 January 2022

29 September 2021

22 June 2021

  • curprev 16:3416:34, 22 June 2021Abrahammurciano talk contribs 19,450 bytes −188 removed false statement. problems do not "change" complexity classes as we discover more efficient algorithms. if we find a polynomial algorithms for a problem not known to be in P, we now know that it is also in P, but it does not cease to be an element of NP, since P is a subset of NP. undo

14 May 2021

8 May 2021

2 May 2021

13 April 2021

1 April 2021

17 January 2021

3 January 2021

2 January 2021

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