On the relationship between energy complexity and other boolean function measures

We focus on energy complexity , a Boolean function measure related closely to Boolean circuit design. Given a circuit 𝒞 over the standard basis {∨ _2,∧ _2,¬} , the energy complexity of 𝒞 , denoted by EC (𝒞) , is the maximum number of its activated inner gates over all inputs. The energy complexity of a Boolean function f , denoted by EC (f) , is the minimum of EC (𝒞) over all circuits 𝒞 computing f . Recently, K. Dinesh et al. (International computing and combinatorics conference, Springer, Berlin, 738–750, 2018) gave EC (f) an upper bound by the decision tree complexity, EC (f)=O( D (f)^3) . On the input size n , They also showed that EC (f) is at most 3n-1 . For the lower bound side, they showed that EC (f)≥1/3 psens (f) , where psens (f) is called positive sensitivity . A remained open problem is whether the energy complexity of a Boolean function has a polynomial relationship with its decision tree complexity. Our results for energy complexity can be listed below. For the lower bound, we prove the equation that EC (f)= (√( D (f))) , which answers the above open problem. For upper bounds, EC (f)≤min{1/2 D (f)^2+O( D (f)),n+2 D (f)-2} holds. For non-degenerated functions, we also provide another lower bound EC (f)= (logn) where n is the input size. We also discuss the energy complexity of two specific function classes, 𝙾𝚁 functions and 𝙰𝙳𝙳𝚁𝙴𝚂𝚂 functions, which implies the tightness of our two lower bounds respectively. In addition, the former one answers another open question in Dinesh et al. (International computing and combinatorics conference, Springer, Berlin, 738–750, 2018) asking for non-trivial lower bound for energy complexity of 𝙾𝚁 functions.