%0 Generic %1 mertens2000computational %A Mertens, Stephan %D 2000 %K combinatorial complexity computational physicists %T Computational Complexity for Physicists %U http://arxiv.org/abs/cond-mat/0012185 %X These lecture notes are an informal introduction to the theory of computational complexity and its links to quantum computing and statistical mechanics.

@misc{mertens2000computational, abstract = {These lecture notes are an informal introduction to the theory of computational complexity and its links to quantum computing and statistical mechanics.}, added-at = {2013-12-23T05:08:48.000+0100}, author = {Mertens, Stephan}, biburl = {https://www.bibsonomy.org/bibtex/2e82129729e02eb0a98e5ca4bb0d71aa8/aeu_research}, description = {Computational Complexity for Physicists}, interhash = {1ea00e6c337f5f433e9bf5c628e274c4}, intrahash = {e82129729e02eb0a98e5ca4bb0d71aa8}, keywords = {combinatorial complexity computational physicists}, note = {cite arxiv:cond-mat/0012185Comment: references updated, reprint available from http://itp.nat.uni-magdeburg.de/~mertens/papers/complexity.shtml}, timestamp = {2013-12-23T08:22:34.000+0100}, title = {Computational Complexity for Physicists}, url = {http://arxiv.org/abs/cond-mat/0012185}, year = 2000 }