مرکز منطقه ای اطلاع رساني علوم و فناوري - Finding a minimal 1-DNF consistent with a positive sample is LOGSNP-complete

Title of article :

Finding a minimal 1-DNF consistent with a positive sample is LOGSNP-complete

Author/Authors :

François Denis، نويسنده ,

Issue Information :

دوهفته نامه با شماره پیاپی سال 1999

Pages :

From page :

To page :

Keywords :

computational complexity , Algorithmic learning theory , Algorithms

Journal title :

Information Processing Letters

Serial Year :

1999

Journal title :

Information Processing Letters

Record number :

129007

Link To Document :