Finding a minimal 1-DNF consistent with a positive sample is LOGSNP-complete (Q294591)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding a minimal 1-DNF consistent with a positive sample is LOGSNP-complete |
scientific article; zbMATH DE number 6594008
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding a minimal 1-DNF consistent with a positive sample is LOGSNP-complete |
scientific article; zbMATH DE number 6594008 |
Statements
Finding a minimal 1-DNF consistent with a positive sample is LOGSNP-complete (English)
0 references
16 June 2016
0 references
computational complexity
0 references
algorithmic learning theory
0 references
