3 ms·
Call me overly skeptical, but polynomial-complexity heuristics may work almost all the time but don’t prove p=NP. Is that is what is going on here? OP needs t
by BobbyTables2 1y ago
Call me overly skeptical, but polynomial-complexity heuristics may work almost all the time but don’t prove p=NP. Is that is what is going on here?
OP needs to receive either the Nobel Prize or treatment for mental illness.
And given they chose JavaScript for the demonstration…
- tocs3 1y agoThere is not a Nobel Prize for mathematics so treatment:)