Timeline for Example of exponential algorithm performing better than a polynomial one?
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 10, 2015 at 22:05 | comment | added | Peva Blanchard | You're right. But, the simplex seems to have polynomial time average complexity. I had in mind comparing complexities of the same type (worst-case, average, ...). Only the constants would change. Thanks anyway! | |
| Feb 10, 2015 at 21:21 | history | answered | Joey Eremondi | CC BY-SA 3.0 |