Pages that link to "Item:Q3520066"
From MaRDI portal
The following pages link to Learning and Verifying Graphs Using Queries with a Focus on Edge Counting (Q3520066):
Displaying 16 items.
- Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions (Q657913) (← links)
- Network verification via routing table queries (Q743125) (← links)
- Reconstructing Markov processes from independent and anonymous experiments (Q906437) (← links)
- Optimal query complexity bounds for finding graphs (Q991004) (← links)
- Non-adaptive learning of a hidden hypergraph (Q1704557) (← links)
- A divide-and-conquer approach for reconstruction of \(\{C_{ \geq 5}\}\)-free graphs via betweenness queries (Q2143136) (← links)
- Reconstruction and verification of chordal graphs with a distance oracle (Q2227489) (← 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)
- Topology discovery of sparse random graphs with few participants (Q2844081) (← links)
- Linear Time Constructions of Some $$d$$-Restriction Problems (Q2947011) (← links)
- Reconstructing Weighted Graphs with Minimal Query Complexity (Q3648745) (← links)
- (Q5136326) (← links)
- On Parity Check (0,1)-Matrix over $\mathbb{Z}_p$ (Q5251659) (← links)
- (Q6075963) (← links)
