Thumbnail
Access Restriction
Subscribed

Author Jordan, Stephen P.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Abstract Which computational problems can be solved in polynomial-time and which cannot? Though seemingly technical, this question has wide-ranging implications and brings us to the heart of both theoretical computer science and modern physics.
Description Affiliation: National Institute of Standards and Technology (NIST), Gaithersburg, Maryland (Jordan, Stephen P.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2015-12-30
Publisher Place New York
Journal XRDS: Crossroads, The ACM Magazine for Students (XRDS)
Volume Number 23
Issue Number 1
Page Count 4
Starting Page 30
Ending Page 33


Open content in new tab

   Open content in new tab
Source: ACM Digital Library