i'm confused since i see some books mention the NP time algorithms as "very lucky" that means it always finds the right path? also can someone explain the coming points to me please...
A nondeterministic computation is viewed as:
(i) when a choice point is reached, an infallible oracle can be consulted to determine the right option. (ii) When a choice point is reached, all choices are made and computation can proceed simultaneously.
thank you in advance , i kinda need to get clear about what NP is about