Publication:3549718
From MaRDI portal
zbMath1231.68139MaRDI QIDQ3549718
Publication date: 5 January 2009
68Q32: Computational learning theory
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Unnamed Item, Optimal bounds for sign-representing the intersection of two halfspaces by polynomials