Title of article
Decomposability of partially defined Boolean functions Original Research Article
Author/Authors
Endre Boros، نويسنده , , Vladimir Gurvich، نويسنده , , Peter L. Hammer، نويسنده , , Toshihide Ibaraki، نويسنده , , Alexander Kogan، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1995
Pages
25
From page
51
To page
75
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.
Journal title
Discrete Applied Mathematics
Serial Year
1995
Journal title
Discrete Applied Mathematics
Record number
884277
Link To Document