OrDB
Paper
  Data
Aizenstein H, Hegedus T, Hellerstein L, Pitt L (1998)
Theoretic hardness results for query learning
7
19
53
1998
Computational Complexity
Other categories referring to Aizenstein H, Hegedus T, Hellerstein L, Pitt L (1998)
Paper.References   (1)
Revisions: 1
Last Time: 8/1/2006 11:05:50 AM
Reviewer: System Administrator
Owner: System Administrator