Smale's problems for the 21st century

A strongly polynomial algorithm for linear programming

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