On the Teaching Complexity of Linear Sets

DOI10.1007/978-3-319-24486-0_7MaRDI QIDQ2835620zbMATH OpenOpenAlexFDO

Authors Ziyuan Gao, Hans Ulrich Simon, Sandra Zilles

Publication date 30 November 2016

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

Full work available at URL https://doi.org/10.1007/978-3-319-24486-0_7

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• On the teaching complexity of linear sets
• Combinatorial results on the complexity of teaching and learning
• Aspects of Linear Complexity
• On sets of linear forms of maximal complexity
• On the Descriptive Complexity of Linear Algebra
• scientific article; zbMATH DE number 19091
• scientific article; zbMATH DE number 898014
• Algebraic methods proving Sauer's bound for teaching complexity
• On teaching sets of k-threshold functions
• Observations on complete sets between linear time and polynomial time

Cites work

• Catalytic P systems, semilinear sets, and vector addition systems
• Distinguishing pattern languages with membership examples
• scientific article; zbMATH DE number 67608 (Why is no real title available?)
• Inductive inference of formal languages from positive data
• Learning semilinear sets from examples and via queries
• Limitations of self-assembly at temperature 1
• Models of cooperative teaching and learning
• Numerical semigroups.
• On Context-Free Languages
• On the complexity of teaching
• Reversal-Bounded Multicounter Machines and Their Decision Problems
• Teachability in computational learning

Cited in

(2)

• Learning semilinear sets from examples and via queries
• On the teaching complexity of linear sets

This page was built for publication: On the Teaching Complexity of Linear Sets

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