scientific article; zbMATH DE number 2080452
From MaRDI portal
Publication:4473244
zbMath1046.68555MaRDI QIDQ4473244
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1968/19680224.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational learning theory (68Q32) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
A hybrid filter/wrapper approach of feature selection using information theory, Self-improved gaps almost everywhere for the agnostic approximation of monomials