History of NP-Hard

Difference (from prior major revision) (author diff)

Changed: 1c1

;NP Hard: Non-deterministic polynomial, a type of computability? problem; see Complexity theory and Complexity classes P and NP.

;NP Hard: Non-deterministic polynomial, a type of computability? problem; see Complexity theory, Complexity classes P and NP, NP-Complete.

	Revision 8 . . December 4, 2001 12:53 am by AxelBoldt [+ link to NP-Complete]
	Revision 7 . . December 4, 2001 12:49 am by AxelBoldt [link to [[Complexity classes P and NP]]]
	Revision 6 . . December 3, 2001 8:06 pm by Hannes Hirzel [Thanks so far; Added remark: Need for additional clarification]
	Revision 5 . . December 3, 2001 7:56 pm by Drsteve
	Revision 4 . . (edit) December 3, 2001 7:19 pm by Hannes Hirzel
	Revision 3 . . December 3, 2001 7:10 pm by Hannes Hirzel [better than just nothing; needs work; see Nupedia]
	Revision 2 . . December 3, 2001 5:33 pm by (logged).99.218.xxx
	Revision 1 . . December 3, 2001 5:33 pm by (logged).99.218.xxx