Average-Case Complexity of Learning Polynomials

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.

Authors

Frank Stephan

This author has not been identified. Look up 'Frank Stephan' in Google

Thomas Zeugmann

This author has not been identified. Look up 'Thomas Zeugmann' in Google