A Complete and Tight Average-Case Analysis of Learning Monomials

RĂ¼diger Reischuk, Thomas Zeugmann. A Complete and Tight Average-Case Analysis of Learning Monomials. In Christoph Meinel, Sophie Tison, editors, STACS 99, 16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 4-6, 1999, Proceedings. Volume 1563 of Lecture Notes in Computer Science, pages 414-423, Springer, 1999. [doi]

@inproceedings{ReischukZ99,
  title = {A Complete and Tight Average-Case Analysis of Learning Monomials},
  author = {RĂ¼diger Reischuk and Thomas Zeugmann},
  year = {1999},
  url = {http://link.springer.de/link/service/series/0558/bibs/1563/15630414.htm},
  tags = {completeness, analysis},
  researchr = {https://researchr.org/publication/ReischukZ99},
  cites = {0},
  citedby = {0},
  pages = {414-423},
  booktitle = {STACS 99, 16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 4-6, 1999, Proceedings},
  editor = {Christoph Meinel and Sophie Tison},
  volume = {1563},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
}