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

DOI10.1016/S0020-0190(98)00185-9zbMATH Open1339.68131OpenAlexW2043133719MaRDI QIDQ294591FDOQ294591

François Denis

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001859?np=y

zbMATH Keywords

computational complexityalgorithmic learning theory

Mathematics Subject Classification ID

Computational learning theory (68Q32) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Simple Constructions of Almost k-wise Independent Random Variables
• PAC learning with simple examples

This page was built for publication: Finding a minimal 1-DNF consistent with a positive sample is LOGSNP-complete

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294591)