Issue No.03 - May/June (2001 vol.3)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/5992.919266
Almost all interesting mathematical algorithmic questions relate to NP-hard questions. Such computation is prone to explode exponentially. The authors anticipate the greatest benefit will come from mathematical platforms that allow for computer-assisted insight generation, not from solutions of grand-challenge problems.
Jonathan M. Borwein, "Challenges in Mathematical Computing", Computing in Science & Engineering, vol.3, no. 3, pp. 48-53, May/June 2001, doi:10.1109/5992.919266