All Questions
Tagged with proof-theory traveling-salesman-problem
1 question
9
votes
4
answers
692
views
What would $\mathcal{P} \neq \mathcal{NP}$ tell us about some non-constructive proofs?
Let me sum up my - hopefully correct - understanding of the travelling salesman problem and complexity classes. It's about decision problems:
"[...] a decision problem is a problem that can be ...
- 82.7k