Jump to content

SNP (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

26 April 2024

23 January 2024

18 August 2023

8 August 2023

28 January 2023

26 July 2022

8 June 2020

8 January 2020

  • curprev 09:4709:47, 8 January 2020 Paul.w.goldberg talk contribs m 5,434 bytes +74 I added a clause to the specification of 3-colorability stipulating that any vertex must satisfy at least one of the 3 predicates. This is needed in order to avoid any graph being trivially satisfied by predicates that always evaluate to false. undo

2 August 2019

17 April 2019

11 February 2019

1 August 2017

31 January 2016

1 May 2015

1 January 2015

2 September 2014

18 December 2010

17 December 2008

4 December 2008

26 November 2008

15 September 2007