P vs NP Problem
P: Solution can be found in polynomial time. Ex- "Is n prime?"
NP: Solution can be verified in polynomial time.Ex-"What integers between 1 and q are prime?"
Ref - Link
P versus NP - Unsolved problem - Good Read
History of P vs NP Problem, Link2
October 09, 2010
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment