Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Challenges in mathematical computing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Borwein, J.M. ; Simon Fraser Univ., Burnaby, BC, Canada ; Borwein, P.B.

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

Published in:

Computing in Science & Engineering  (Volume:3 ,  Issue: 3 )