Pages that link to "Item:Q927873"
From MaRDI portal
The following pages link to Learning a hidden graph using \(O(\log n)\)queries per edge (Q927873):
Displaying 23 items.
- Learning Boolean halfspaces with small weights from membership queries (Q329608) (← links)
- Learning a hidden graph (Q479267) (← 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)
- Non-adaptive learning of a hidden hypergraph (Q1704557) (← links)
- Finding hidden independent sets in interval graphs (Q1884976) (← links)
- A divide-and-conquer approach for reconstruction of \(\{C_{ \geq 5}\}\)-free graphs via betweenness queries (Q2143136) (← links)
- Network construction with subgraph connectivity constraints (Q2253960) (← 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)
- COMPETITIVE GROUP TESTING AND LEARNING HIDDEN VERTEX COVERS WITH MINIMUM ADAPTIVITY (Q3063600) (← links)
- Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries (Q3087620) (← links)
- (Q3174038) (← links)
- Learning Theory (Q4680878) (← links)
- Recovering Social Networks from Individual Attributes (Q4911188) (← links)
- Error-tolerant non-adaptive learning of a hidden hypergraph (Q5005098) (← links)
- (Q5136326) (← links)
- On Sampling Edges Almost Uniformly (Q5240421) (← links)
- Almost Optimal Cover-Free Families (Q5283363) (← links)
- Automata, Languages and Programming (Q5466454) (← links)
- Edge and pair queries-random graphs and complexity (Q6162142) (← links)
