Title of article :
Note on complexity of computing the domination of binary systems
Author/Authors :
A.A. Chernyak، نويسنده , , Zh.A. Chernyak، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1996
Abstract :
The problem of computing the domination of a coherent binary system all minimal paths sets of which have equal cardinality k (k > 1), is proved to be #P-complete. Some corollaries are given.
Journal title :
Discrete Applied Mathematics
Journal title :
Discrete Applied Mathematics
