factual
Engineers approximate NP-hard problems in practice
While proving a problem like the traveling salesman is NP-hard, engineers in practice write algorithms that with very high probability find solutions nearly as good as optimal, so hard problems are routinely solved approximately even though provable optimal solutions are out of reach.
factualpending
Speaker
Jordan EllenbergEvidence Quote
“while you're over there proving your theorem, I'm just making the path, I'm doing it.”
Created: 6/13/2026, 12:30:48 AM
Your notes
Loading notes...