>>12141094Be sure to post the exact NP-hard problem you think you have a polynomial-time algorithm for, and why you think your algorithm is polynomial-time.
With the wrong formulation you can get things like the problem of finding the global minimum of an arbitrary function of the real unit interval presented by an oracle, where after any finite number of steps an adversary can always find a function that agrees with the oracle values you have seen, but disagrees with anything you claim is the minimum.
