History of Complexity classes P and NP

Difference (from prior major revision) (no other diffs)

Removed: 32d31

// This algorithm runs in polynomial time if and only if P=NP.

Changed: 34c33,36

// Input: S = a set of integers

// This algorithm yields positive answers in polynomial time
// if and only if P=NP.
//
// Input: S = a finite set of integers

	Revision 22 . . December 18, 2001 2:37 pm by AxelBoldt
	Revision 21 . . December 18, 2001 8:43 am by LC [Algorithm that's polytime iff P=NP]
	Revision 20 . . (edit) December 17, 2001 5:31 am by (logged).117.133.xxx
	Revision 19 . . (edit) December 17, 2001 5:31 am by (logged).117.133.xxx
	Revision 18 . . December 7, 2001 1:27 pm by (logged).138.87.xxx
	Revision 17 . . December 7, 2001 1:27 pm by (logged).138.87.xxx
	Revision 16 . . (edit) December 6, 2001 7:22 am by (logged).202.117.xxx
	Revision 15 . . December 4, 2001 12:52 am by AxelBoldt
	Revision 14 . . November 26, 2001 4:40 am by (logged).117.133.xxx
	Revision 13 . . August 27, 2001 7:04 am by AxelBoldt *[fix Pascal link]**