Author/Authors :
Endre Boros، نويسنده , , Vladimir Gurvich، نويسنده , , Peter L. Hammer، نويسنده , , Toshihide Ibaraki، نويسنده , , Alexander Kogan، نويسنده ,
Abstract :
The problem of recognizing decomposability of partially defined Boolean functions is considered. The results include polynomial time algorithms for certain important types of decomposition, as well as NP-completeness proofs for more complex structures.
