The problem of recognizing decomposability of partially defined Boolea
n functions is considered. The results include polynomial time algorit
hms for certain important types of decomposition, as well as NP-comple
teness proofs for more complex structures.