This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Challenges in Mathematical Computing
May/June 2001 (vol. 3 no. 3)
pp. 48-53
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.
Citation:
Jonathan M. Borwein, Peter B. Borwein, "Challenges in Mathematical Computing," Computing in Science and Engineering, vol. 3, no. 3, pp. 48-53, May-June 2001, doi:10.1109/5992.919266
Usage of this product signifies your acceptance of the Terms of Use.