Published: September 01, 2016
Stephen P. Jordan
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.
Citation: XRDS: crossroads (ACM's undergraduate magazine)
Pub Type: Others
quantum computing, complexity theory
Created September 01, 2016, Updated November 10, 2018