Learning-Related Complexity of Linear Ranking Functions

Atsuyoshi Nakamura. Learning-Related Complexity of Linear Ranking Functions. In José L. Balcázar, Philip M. Long, Frank Stephan, editors, Algorithmic Learning Theory, 17th International Conference, ALT 2006, Barcelona, Spain, October 7-10, 2006, Proceedings. Volume 4264 of Lecture Notes in Computer Science, pages 378-392, Springer, 2006. [doi]

@inproceedings{Nakamura06:1,
  title = {Learning-Related Complexity of Linear Ranking Functions},
  author = {Atsuyoshi Nakamura},
  year = {2006},
  doi = {10.1007/11894841_30},
  url = {http://dx.doi.org/10.1007/11894841_30},
  researchr = {https://researchr.org/publication/Nakamura06%3A1},
  cites = {0},
  citedby = {0},
  pages = {378-392},
  booktitle = {Algorithmic Learning Theory, 17th International Conference, ALT 2006, Barcelona, Spain, October 7-10, 2006, Proceedings},
  editor = {José L. Balcázar and Philip M. Long and Frank Stephan},
  volume = {4264},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-46649-5},
}