Chapter 10: Complexity, Hardness, and What Quantum Computers Can Promise

This section is already in the book plan, but it has not been written fully yet. The book owner can press Generate section to write this part with the language model connected to TheoryTrace.

Section plan:

Explains P, NP, NP-hardness, approximation, heuristics, worst-case versus practical performance, and gives an honest view of what quantum speedups are known, suspected, or unproven in optimization.