Learning an intersection of a constant number of halfspaces over a uniform distribution
type: Item
instance of: scholarly article
title: Learning an intersection of a constant number of halfspaces over a uniform distribution
zbMATH Open document ID: 0877.68064
author: Avrim Blum
author: R. Kannan
published in: Journal of Computer and System Sciences
publication date: 1997-12-08T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 1022060
zbMATH Keywords: polynomial-time algorithm
MaRDI profile type: Publication
OpenAlex ID: W2015194364
cites work: On learning a union of half spaces
cites work: Geometry. I, II. Transl. from the French by M. Cole and S. Levy
cites work: Learnability and the Vapnik-Chervonenkis dimension
cites work: Efficient noise-tolerant learning from statistical queries
cites work: Composite geometric concepts and polynomial predictability
cites work: Q5574451
cites work: A theory of the learnable
DOI: 10.1006/JCSS.1997.1475
description: scientific article; zbMATH DE number 1022060