The complexity of exactly learning algebraic concepts

DOI10.1007/3-540-61863-5_38MaRDI QIDQ3556984zbMATH OpenOpenAlexFDO

Authors Vikraman Arvind, N. V. Vinodchandran

Publication date 27 April 2010

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

Full work available at URL https://doi.org/10.1007/3-540-61863-5_38

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational learning theory (68Q32)

Recommendations

• Exact learning via teaching assistants
• scientific article; zbMATH DE number 1263194
• How many queries are needed to learn?
• Computing and Combinatorics
• Oracles and queries that are sufficient for exact learning

Cited in

(5)

• A new abstract combinatorial dimension for exact learning via queries
• Computational complexity of learning algebraic varieties
• An algebra of human concept learning
• Computing and Combinatorics
• Artificial Intelligence and Symbolic Computation

This page was built for publication: The complexity of exactly learning algebraic concepts

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