5 ms·
The possibility of it being accepted depends on the nature of the improvement. If your improvement, for example, takes it from 100n^3 to30 n^3 operations, your
by lliiffee 18y ago
The possibility of it being accepted depends on the nature of the improvement. If your improvement, for example, takes it from 100n^3 to30 n^3 operations, your odds of being accepted are very low. If you go from 100n^3 to 100n^2 (or even 10000n^2), and that has never been discovered before, it is definitely publishable. However, even so, it is important that you write in the correct style, because (unfortunately) there are certain conventions, and many journals aren't that friendly to "outsiders". So the advice of getting someone who has published to look at it is very good.
Nevertheless, it depends on the nature of the improvement, as I said above. If you have that, you can be sure that it can eventually be published.
- bdittmer 18y ago100n^3 and 30n^3 are both O(n^3)...no improvement, hence it won't be published. Depending on the problem the algorithm is solving O(n^3) to O(n^2) can be a massive improvement.
- rw 18y agoConstant-time factors matter to everyone working with finite resources.
- cperciva 18y agoIf your improvement, for example, takes it from 100 n^3 to 30 n^3 operations, your odds of being accepted are very low. I'm not sure I'd go that far. There have been many papers published which make improvements in the constant factors in FFTs, and a few others in areas like integer factorization and primality proving. What matters is whether the work is exciting to other people in the field -- an improvement which is inconsequential in one field could be groundbreaking in another.