The following pages link to Approximable sets (Q1898468):
Displaying 17 items.
- On the complexity of nonuniform wavelength-based machine (Q256966) (← links)
- Sparse sets, approximable sets, and parallel queries to NP (Q294651) (← links)
- Deciding the Vapnik-Červonenkis dimension is \(\Sigma_3^p\)-complete (Q1305933) (← links)
- Geometric sets of low information content (Q1351460) (← links)
- Learning recursive functions from approximations (Q1370868) (← links)
- Time bounded frequency computations (Q1383147) (← links)
- Query complexity of membership comparable sets. (Q1401341) (← links)
- Some connections between bounded query classes and non-uniform complexity. (Q1426008) (← links)
- Sparse selfreducible sets and nonuniform lower bounds (Q1755786) (← links)
- On the reducibility of sets inside NP to sets with low information content (Q1765294) (← links)
- Commutative queries (Q1854422) (← links)
- Optimal series-parallel trade-offs for reducing a function to its own graph (Q1854508) (← links)
- On membership comparable sets (Q1961377) (← links)
- The value of help bits in randomized and average-case complexity (Q2012180) (← links)
- One query reducibilities between partial information classes (Q2575741) (← links)
- The enumerability of P collapses P to NC (Q2575747) (← links)
- On sets bounded truth-table reducible to $P$-selective sets (Q4717049) (← links)
