# Strong polynomial algorithm for linear programming

What is the current state of finding a strong polynomial algorithm for linear programming? Is there any reference?

Basically, it says that only bitsizes of coefficients in the constraints matrix $A$ need to be taken into account, whereas sizes of coefficients in the RHS $b$ and in the objective function $c$ don't matter, for the LP in the usual form $$\max_x \langle c,x\rangle \quad \text{subject to }Ax\leq b.$$