The following pages link to Learning Theory (Q4680878):
Displaying 15 items.
- 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)
- 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)
- Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries (Q3087620) (← links)
- (Q3174038) (← links)
- Learning and Verifying Graphs Using Queries with a Focus on Edge Counting (Q3520066) (← links)
- Reconstructing Weighted Graphs with Minimal Query Complexity (Q3648745) (← links)
- Error-tolerant non-adaptive learning of a hidden hypergraph (Q5005098) (← links)
- On Sampling Edges Almost Uniformly (Q5240421) (← links)
- Automata, Languages and Programming (Q5466454) (← links)
- Learning Theory (Q5473637) (← links)
- Edge and pair queries-random graphs and complexity (Q6162142) (← links)
