This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Computational Complexity for Physicists
May/June 2002 (vol. 4 no. 3)
pp. 31-47

The branch of theoretical computer science known as computational complexity is concerned with classifying problems according to the computational resources required to solve them. This theory has some interesting links to physics, in particular to quantum computing and statistical mechanics. This article contains an informal introduction to this theory and its links to physics.

Index Terms:
computational complexity, quantum computing, statistical mechanics
Citation:
Stephan Mertens, "Computational Complexity for Physicists," Computing in Science and Engineering, vol. 4, no. 3, pp. 31-47, May-June 2002, doi:10.1109/5992.998639
Usage of this product signifies your acceptance of the Terms of Use.