Title of article :
On algorithms for construction of all irreducible partial covers
Author/Authors :
Mikhail Ju. Moshkov، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 2007
Keywords :
Irreducible partial cover , Totally polynomial algorithm , computational complexity
Journal title :
Information Processing Letters
Journal title :
Information Processing Letters