Examples of problems where exponential algorithms run faster than polynomial algorithms for practical sizes?
How bout the simplex algorithm for linear programming?
In many occasions it is used in practice.
Edited to add:
I think it's more of a &quot;worse-case exponential algorithm&quot; which runs efficiently on practical instances/distributions rather than runs faster on practical sized adversarial instances.