Ask HN: Feedback requested for an argument about P =/= NP
An argument that P != NP1) Multiplication problems (ab, a AND b) are less computationally expensive than addition problems (a+b) by a factor of about 2.2) NP problems can have in the worst case scenario somewhere in the vicinity of N^K OR operations.3) P problems have OR operations on the order of NK operations.4) The increase of AND problems as P --> NP scales linearly in terms of increased...