Learning from rounded-off data.

DOI10.1016/S0890-5401(03)00015-4zbMath1036.68061OpenAlexW2040660764WikidataQ57733242 ScholiaQ57733242MaRDI QIDQ1873753

Felipe Cucker, Dennis Cheung

Publication date: 27 May 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0890-5401(03)00015-4

zbMATH Keywords

multivariate polynomialsPAC learning

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Cites Work

• Unnamed Item
• Unnamed Item
• On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
• Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers
• Learnability and the Vapnik-Chervonenkis dimension
• Sur la complexité du principe de Tarski-Seidenberg
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Incorporating Condition Measures into the Complexity Theory of Linear Programming

This page was built for publication: Learning from rounded-off data.