Computational Complexity for Physicists

Abstract

These lecture notes are an informal introduction to the theory of computational complexity and its links to quantum computing and statistical mechanics.

references updated, reprint available from http://itp.nat.uni-magdeburg.de/~mertens/papers/complexity.shtml

References in corpus (1)

• Analysis of the computational complexity of solving random satisfiability problems using branch and bound search algorithms

Cited by in corpus (1)

• Crossover phenomenon in the performance of an Internet search engine