The index

Smale's problems for the 21st century

2 entries matching the current filters. Sorted by recently added.

Smale's ninth problem: is there an LP algorithm whose arithmetic operation count does not depend on the bit size of the input?

If a polynomial map has constant non-zero Jacobian determinant, must it be invertible?