On learning embedded midbit functions
From MaRDI portal
Publication:817826
DOI10.1016/J.TCS.2005.10.013zbMATH Open1086.68067OpenAlexW2124567957MaRDI QIDQ817826FDOQ817826
Authors: Rocco A. Servedio
Publication date: 20 March 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.10.013
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Computational learning theory (68Q32)
Cites Work
- Learnability and the Vapnik-Chervonenkis dimension
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A theory of the learnable
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- On ACC
- Finite monoids and the fine structure of NC 1
- Learning DNF in time
- The power of the middle bit of a \(\#\)P function
- On Learning Ring-Sum-Expansions
- Depth reduction for circuits of unbounded fan-in
- Learning Integer Lattices
- Title not available (Why is that?)
Cited In (1)
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)