scientific article; zbMATH DE number 2089966

MaRDI QIDQ4808629zbMATH OpenFDO

Authors Tatsuya Akutsu, Sascha Ott

Publication date 12 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2387/23870117.htm

Mathematics Subject Classification ID

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

Recommendations

• On learning a union of half spaces
• A Distinguishing Example in k-Spaces
• Some estimates of the inductive dimensions of the union of two sets
• scientific article; zbMATH DE number 5143480
• On finite unions of certain D-spaces
• scientific article; zbMATH DE number 503460
• Learning an intersection of a constant number of halfspaces over a uniform distribution
• Unconditional lower bounds for learning intersections of halfspaces
• scientific article; zbMATH DE number 2141045
• *-half completeness in quasi-uniform spaces

This page was built for publication:

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