Summary: We define and discuss three complexity measures for Boolean functions and three equivalence relations which classify Boolean functions into classes with same number of implementations, subfunctions or separable sets. These relations induce three transformation groups. Using a class library for Boolean functions manipulation we have executed three algorithms to compute these new complexity measures.