| ▲ | OJFord 12 hours ago | |
(I'm not either fwiw) think of the complexity of matrix multiplication for example – if you have a novel approach that gives a new lower bound, you'll want to put some time and thought into ensuring it's the 'lowest lower bound' you can reasonably find that way for the most impressive result, not overshadowed by someone using the same approach to go lower too quickly. A similar example here might be someone realising they can extend it to the extended Reimann hypothesis. Or simply cutting out a load of steps to prove the same thing more straightforwardly and intuitively. | ||