new thread, notes added to address all questions from the last thread
New thread, notes added to address all questions from the last thread
Thomas Price
Benjamin Bailey
note that:
The reduction (or fold) used doesn't matter, and is what separates the different NP-complete problems. Changing the reduction just changes one NP-complete problem to another.
It's trivial to prove that an invalid power key can leave only 2 subsets out of order by creating a small set and adjusting with the values and the power key to force this situation, just to prove it's possible
Kevin Howard
Pretty cool senpai, write up your paper and get it published and deny your million dollars.
Dylan Bailey
rather shit post on Veeky Forums since i'm not claiming the money anyway, fuck all those people
i'm going to give it a few weeks of people attacking the proof before claiming a final version... it's already doubled in size with notes and clarifications
Charles Ross
You have to claim your millennial prize though even if you deny the money. They'll give you the title either way.
Luke Taylor
added more clarifications to the screenshot
Caleb Reyes
>if any tricks exist with the sum operation, use a different one
>but again the operation used doesn't matter
you are contradicting yourself
so does the operation matter or not?
kys subhuman trash
Juan Gomez
this is long past being funny. It's just annoying now
Isaiah Thompson
why do you keep spamming new threads
your other thread had 60 posts, stay in your fucking hole at least
Owen Clark
it doesn't matter BECAUSE you can swap it out. literally proven ages ago this is the case and that all NP-complete problems are just the same problem with a reduction swapped out
fuck you for not knowing what an NP-complete problem is