Complexity theory/Talk

The study of complex systems is also called complexity theory, which is apparently quite a different subject then the one being discussed here.

Perhaps this article should be [Computational Complexity Theory]?.

---

I always thought that NP-hard problems need not be decision problems. For instance, finding the shortest roundtrip in a weighted graph is NP-hard; deciding whether a roundtrip shorter than a given number exists is NP-complete. --AxelBoldt