Xionn - Slashdot User

Comment Re:Stupid much? (Score 1) 228

by Xionn on Tuesday February 19, 2008 @08:46AM (#22473626) Attached to: The Limits of Quantum Computing

Stupid much? :) Factoring isn't proven NP-complete, sure its in NP but that doesn't tell you much. Read, http://en.wikipedia.org/wiki/Prime_Factorization#Difficulty_and_complexity

« Newer Older »

The bugs you have to avoid are the ones that give the user not only the inclination to get on a plane, but also the time. -- Kay Bostic