We describe how combinatorial enumeration and listing problem in connection with structural properties of hypermatrices determine critical aspect of the complexity of Boolean function. The talk will not assume any familiarity with Boolean functions.