This thesis is broadly divided into two parts: i) Study of width bounded arithmetic circuits, and ii) Computational complexity of matroid isomorphism problems. Various arithmetizations of boolean complexity class NC1 is ...