Resource-bounded measure and learnability

DOI10.1007/s002249910010zbMath1008.68061OpenAlexW1978343600MaRDI QIDQ1974447

Osamu Watanabe, Rainer Schuler, Wolfgang Lindner

Publication date: 7 May 2000

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002249910010

zbMATH Keywords

computational learning theorypolynomial-time learnable subclasses

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Related Items (3)

Dimension, halfspaces, and the density of hard sets ⋮ Efficient learning algorithms yield circuit lower bounds ⋮ Exact Learning Algorithms, Betting Games, and Circuit Lower Bounds

This page was built for publication: Resource-bounded measure and learnability