On Tue, Jul 04, 2006 at 02:29:56AM -0400, Chet Uber wrote: > NP-complete problems are the most difficult complexity problems.
No, NP-complete problems are the most difficult problems _in NP_.
- Re: Preventing password reuse Chris Zakelj
- Re: Preventing password reuse Marcus Watts
- Re: Preventing password reuse Jeff Simmons
- Re: Preventing password reuse Chet Uber
- Re: Preventing password reuse L. V. Lammert
- Re: Preventing password reuse Chet Uber
- Re: Preventing password reuse Damien Miller
- Re: Preventing password reuse Chet Uber
- Re: Preventing password reuse Matthew R. Dempsky
- Re: Preventing password reuse Chet Uber
- Re: Preventing password reuse Matthew R. Dempsky
- Re: Preventing password reuse Joachim Schipper
- Re: Preventing password reuse Rod.. Whitworth
- Re: Preventing password reuse Paul de Weerd
- Re: Preventing password reuse Steffen Kluge
- Re: Preventing password reuse Stuart Henderson
- Re: Preventing password reuse Nick Holland
- Re: Preventing password reuse Jeff Simmons
- Re: Preventing password reuse Joachim Schipper
- Re: Preventing password reuse STeve Andre'
- Re: Preventing password reuse Joachim Schipper
