Where np is the set of all problems (complex or otherwise), here defined as the solution to a two dimensional vector, for which the solution can be verified in polynomial time (i.e. it is possible to determine the solution in the time given to us).
Tuesday, August 19, 2008
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment