Tackling intractable computing problems

Tackling intractable computing problems 06/29/2016 12:00 AM EDT Computers have proven capable of helping scientists solve many research problems, from the dynamics of black hole mergers to distant connections in reams of genomic data. But there are some problems that computers cannot solve -- at least not in a reasonable time frame. The question concerning which problems can and can't be solved efficiently, also known as "intractability," are a great scientific challenge for computer scientists. One such question is one of the ... More at http://www.nsf.gov/discoveries/disc_summ.jsp?cntn_id=138011&WT.mc_id=USNSF_51&WT.mc_ev=click This is an NSF News and Discoveries item. Save This e-mail update was generated automatically based on your subscription to the category listed above. Some updates may belong to more than one category, resulting in duplicate messages.   Subscriber Services: Manage Preferences  |  Unsubscribe  |  Help  |  Contact NSF   Follow NSF:    Save This email was sent to mantiskhiralla@gmail.com using GovDelivery, on behalf of: National Science Foundation Update · 4201 Wilson Boulevard · Arlington, VA 22230 · 703-292-5111