On the Smallest Possible Dimension and the Largest Possible Margin of Linear Arrangements Representing Given Concept Classes Uniform Distribution

Forster and Simon. "On the Smallest Possible Dimension and the Largest Possible Margin of Linear Arrangements Representing Given Concept Classes Uniform Distribution." International Conference on Algorithmic Learning Theory, 2002. doi:10.1007/3-540-36169-3_12

[Forster and Simon. "On the Smallest Possible Dimension and the Largest Possible Margin of Linear Arrangements Representing Given Concept Classes Uniform Distribution." International Conference on Algorithmic Learning Theory, 2002.](https://mlanthology.org/alt/2002/forster2002alt-smallest/) doi:10.1007/3-540-36169-3_12

@inproceedings{forster2002alt-smallest,
  title     = {{On the Smallest Possible Dimension and the Largest Possible Margin of Linear Arrangements Representing Given Concept Classes Uniform Distribution}},
  author    = {Forster, Jürgen and Simon, Hans Ulrich},
  booktitle = {International Conference on Algorithmic Learning Theory},
  year      = {2002},
  pages     = {128-138},
  doi       = {10.1007/3-540-36169-3_12},
  url       = {https://mlanthology.org/alt/2002/forster2002alt-smallest/}
}