The following pages link to (Q3174038):
Displaying 17 items.
- Learning Boolean halfspaces with small weights from membership queries (Q329608) (← links)
- Learning a hidden graph (Q479267) (← links)
- Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions (Q657913) (← links)
- Learning a hidden uniform hypergraph (Q683922) (← links)
- Reconstruction of hidden graphs and threshold group testing (Q719032) (← links)
- Reconstructing Markov processes from independent and anonymous experiments (Q906437) (← links)
- Learning a hidden graph using \(O(\log n)\)queries per edge (Q927873) (← links)
- Optimal query complexity bounds for finding graphs (Q991004) (← links)
- Non-adaptive learning of a hidden hypergraph (Q1704557) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- Non-adaptive Learning of a Hidden Hypergraph (Q2835619) (← links)
- Linear Time Constructions of Some $$d$$-Restriction Problems (Q2947011) (← links)
- Learning and Verifying Graphs Using Queries with a Focus on Edge Counting (Q3520066) (← links)
- Reconstructing Weighted Graphs with Minimal Query Complexity (Q3648745) (← links)
- Learning Theory (Q4680878) (← links)
- Error-tolerant non-adaptive learning of a hidden hypergraph (Q5005098) (← links)
- Learning Theory (Q5473637) (← links)
