3 ms·
The question being asked was "what would proving P=NP mean for us in practical terms". The fact that mathematicians call all polynomial-time algorithms efficien
by tsimionescu 3y ago
The question being asked was "what would proving P=NP mean for us in practical terms". The fact that mathematicians call all polynomial-time algorithms efficient is irrelevant to this question.
- johnday 3y ago> The question being asked Where was that question asked?
- tsimionescu 3y agoIt wasn't exactly a question, but the thread started by discussing practical implications: > That said, there is definitely potential practical implications for this. Even if it means we can know np problems do not have efficient solutions [emphasis mine] So, this was about efficiency in the practical sense, not some largely useless definition of efficiency by which galactic algorithms are "efficient".