• Complexity measures of Boolean functions and their applications 

      Chaubal, Siddhesh Prashant; 0000-0003-1462-5127 (2020-12-15)
      The central focus of computational complexity theory is to measure the "hardness" of computing different functions. Towards this end, several measures of complexity for Boolean functions have been studied over the past few ...