Time hierarchies for sampling distributions
From MaRDI portal
Recommendations
Cites work
- A model of interactive teaching
- A theory of goal-oriented communication
- A theory of the learnable
- Algorithmic Learning Theory
- Derandomizing polynomial identity tests means proving circuit lower bounds
- scientific article; zbMATH DE number 3154781 (Why is no real title available?)
- scientific article; zbMATH DE number 67625 (Why is no real title available?)
- scientific article; zbMATH DE number 67631 (Why is no real title available?)
- scientific article; zbMATH DE number 1559537 (Why is no real title available?)
- In search of an easy witness: Exponential time vs. probabilistic polynomial time.
- Learning from different teachers
- Measuring teachability using variants of the teaching dimension
- Models of cooperative teaching and learning
- Occam's razor
- On specifying Boolean functions by labelled examples
- On the complexity of teaching
- On the limits of efficient teachability
- On the power of inductive inference from good examples
- Pseudorandom generators for space-bounded computation
- Recent Developments in Algorithmic Teaching
- Teachability in computational learning
- Teaching a smarter learner.
- Teaching Randomized Learners
Cited in
(7)- On average time hierarchies
- Polynomial time samplable distributions
- Sampling hierarchies of discrete random structures
- Sampling at a random time with a heavy-tailed distribution
- Heuristic time hierarchies via hierarchies for sampling distributions
- scientific article; zbMATH DE number 1114051 (Why is no real title available?)
- Time hierarchies for sampling distributions
This page was built for publication: Time hierarchies for sampling distributions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986891)