ThePlague
- Karma
- -2
- Created
- April 14, 2010 (16y ago)
- Submissions
- 0
- Towards a Computational Monism (blogkinnetic.blogspot.com)
-
An argument that P != NP 1) 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…