Frank Stephan, Thomas Zeugmann. Average-Case Complexity of Learning Polynomials. In Nicolò Cesa-Bianchi, Sally A. Goldman, editors, Proceedings of the Thirteenth Annual Conference on Computational Learning Theory (COLT 2000), June 28 - July 1, 2000, Palo Alto, California. pages 59-68, Morgan Kaufmann, 2000.
@inproceedings{StephanZ00,
title = {Average-Case Complexity of Learning Polynomials},
author = {Frank Stephan and Thomas Zeugmann},
year = {2000},
researchr = {https://researchr.org/publication/StephanZ00},
cites = {0},
citedby = {0},
pages = {59-68},
booktitle = {Proceedings of the Thirteenth Annual Conference on Computational Learning Theory (COLT 2000), June 28 - July 1, 2000, Palo Alto, California},
editor = {Nicolò Cesa-Bianchi and Sally A. Goldman},
publisher = {Morgan Kaufmann},
isbn = {1-55860-703-X},
}