Average-Case Complexity of Learning Polynomials

Cite

Text

Stephan and Zeugmann. "Average-Case Complexity of Learning Polynomials." Annual Conference on Computational Learning Theory, 2000.

Markdown

[Stephan and Zeugmann. "Average-Case Complexity of Learning Polynomials." Annual Conference on Computational Learning Theory, 2000.](https://mlanthology.org/colt/2000/stephan2000colt-average/)

BibTeX

@inproceedings{stephan2000colt-average,
  title     = {{Average-Case Complexity of Learning Polynomials}},
  author    = {Stephan, Frank and Zeugmann, Thomas},
  booktitle = {Annual Conference on Computational Learning Theory},
  year      = {2000},
  pages     = {59-68},
  url       = {https://mlanthology.org/colt/2000/stephan2000colt-average/}
}