$46.$ What differentiates Karmarkar's algorithm's computational complexity from that of other linear programming methods like the simplex method?

a$)$ Its use of dual simplex iterations

b$)$ Its polynomial complexity irrespective of problem size

c$)$ Its exponential scaling with the number of constraints

d$)$ Its quadratic convergence rate