An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution

Philip M. Long. An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution. Inf. Process. Lett., 87(5):229-234, 2003. [doi]

@article{Long03:3,
  title = {An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution},
  author = {Philip M. Long},
  year = {2003},
  doi = {10.1016/S0020-0190(03)00311-9},
  url = {http://dx.doi.org/10.1016/S0020-0190(03)00311-9},
  researchr = {https://researchr.org/publication/Long03%3A3},
  cites = {0},
  citedby = {0},
  journal = {Inf. Process. Lett.},
  volume = {87},
  number = {5},
  pages = {229-234},
}