Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Borwein et al. (2001) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: