Learning real polynomials with a Turing machine

DOI10.1007/3-540-46769-6_19MaRDI QIDQ4955314zbMATH OpenFDO

Authors Dennis Cheung

Publication date 25 May 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46769-6_19

zbMATH Keywords

PAC learning

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• Universal algorithms for learning theory. II: Piecewise polynomial functions
• scientific article; zbMATH DE number 67608
• scientific article; zbMATH DE number 800043
• On the integer polynomial learning with errors problem
• Determining the number of real roots of polynomials through neural networks
• Applying machine learning to heuristics for real polynomial constraint solving
• A convergent deep learning algorithm for approximation of polynomials
• Equivalence of models for polynomial learnability
• Learning polynomials with queries: The highly noisy case

Cited in

(3)

• Learning from rounded-off data.
• scientific article; zbMATH DE number 1696656 (Why is no real title available?)
• On learning multivariate polynomials under the uniform distribution

This page was built for publication: Learning real polynomials with a Turing machine

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4955314)