Recommendations
Cites work
- scientific article; zbMATH DE number 3127542 (Why is no real title available?)
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- scientific article; zbMATH DE number 4117877 (Why is no real title available?)
- scientific article; zbMATH DE number 3308309 (Why is no real title available?)
- scientific article; zbMATH DE number 3314813 (Why is no real title available?)
- A theory of the learnable
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Depth reduction for circuits of unbounded fan-in
- Finite monoids and the fine structure of NC 1
- Learnability and the Vapnik-Chervonenkis dimension
- Learning DNF in time
- Learning Integer Lattices
- On ACC
- On Learning Ring-Sum-Expansions
- The power of the middle bit of a \(\#\)P function
This page was built for publication: On learning embedded midbit functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817826)