• DocumentCode
    1474321
  • Title

    Challenges in mathematical computing

  • Author

    Borwein, Jonathan M. ; Borwein, Peter B.

  • Author_Institution
    Simon Fraser Univ., Burnaby, BC, Canada
  • Volume
    3
  • Issue
    3
  • fYear
    2001
  • Firstpage
    48
  • Lastpage
    53
  • 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;
  • fLanguage
    English
  • Journal_Title
    Computing in Science & Engineering
  • Publisher
    ieee
  • ISSN
    1521-9615
  • Type

    jour

  • DOI
    10.1109/5992.919266
  • Filename
    919266
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1474321