Title :
Challenges in mathematical computing
Author :
Borwein, Jonathan M. ; Borwein, Peter B.
Author_Institution :
Simon Fraser Univ., Burnaby, BC, Canada
Abstract :
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
Keywords :
computational complexity; mathematics computing; symbol manipulation; NP-hard questions; computer-assisted insight generation; grand-challenge problems; mathematical algorithmic questions; mathematical computing; mathematical platforms; Algebra; Computer architecture; Computer networks; Databases; Encyclopedias; HTML; Java; Mathematics; Packaging; Statistics;
Journal_Title :
Computing in Science & Engineering
DOI :
10.1109/5992.919266
