"Complexity Theoretic Hardness Results for Query Learning."

Howard Aizenstein et al. (1998)

> Home

Details and statistics

DOI: 10.1007/PL00001593

access: closed

type: Journal Article

metadata version: 2020-03-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cc/AizensteinHHP98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cc/AizensteinHHP98
Howard Aizenstein, Tibor Hegedüs, Lisa Hellerstein, Leonard Pitt:
Complexity Theoretic Hardness Results for Query Learning. Comput. Complex. 7(1): 19-53 (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.