"A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions."

Avrim Blum et al. (1998)

> Home

Details and statistics

DOI: 10.1007/PL00013833

access: closed

type: Journal Article

metadata version: 2019-10-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/BlumFKV98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/BlumFKV98
Avrim Blum, Alan M. Frieze, Ravi Kannan, Santosh S. Vempala:
A Polynomial-Time Algorithm for Learning Noisy Linear Threshold Functions. Algorithmica 22(1/2): 35-52 (1998)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.