This claim will be held true if the computational class NP (non-deterministic polynomially determinable) is proven to be distinct from P (polynomial) for some category of NP (i.e. NP-hard, NP-complete, etc.). This does not require proof for the full spectrum of NP. A proof will be held acceptable if it has reached general consensus in the relevant communities (i.e. among academics in the area of computational complexity - Comp. Sci., Oper. Res., et.al.), and has received at least 10 citations in peer-review journals.
None.
