## A Permanent Formula with Many Zero-Valued Terms

- Eric T. Bax, Joel Franklin
- Inf. Process. Lett.
- 1997

We develop an algorithm for the traveling salesman problem by applying nite diierences to a generating function. This algorithm requires polynomial space. In comparison, a dynamic programming algorithm requires exponential space. Also, the nite-diierence algorithm requires less space than a similar inclusion and exclusion algorithm.

### Presentations referencing similar topics