Pages that link to "Item:Q5915407"
From MaRDI portal
The following pages link to Optimal reconstruction of graphs under the additive model (Q5915407):
Displaying 25 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)
- Reconstruction of hidden graphs and threshold group testing (Q719032) (← links)
- Toward a deterministic polynomial time algorithm with optimal additive query complexity (Q764325) (← links)
- Reconstructing Markov processes from independent and anonymous experiments (Q906437) (← links)
- Optimal query complexity bounds for finding graphs (Q991004) (← links)
- Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping (Q1281767) (← links)
- Query complexity of mastermind variants (Q1690229) (← links)
- Communication and location discovery in geometric ring networks (Q1740645) (← links)
- Generalized framework for group testing: queries, feedbacks and adversaries (Q2136279) (← links)
- Reconstruction and verification of chordal graphs with a distance oracle (Q2227489) (← links)
- Reconstructing weighted graphs with minimal query complexity (Q2431425) (← links)
- An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution (Q2471071) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- Learning and Verifying Graphs Using Queries with a Focus on Edge Counting (Q3520066) (← links)
- Reconstructing Weighted Graphs with Minimal Query Complexity (Q3648745) (← links)
- Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness (Q4903279) (← links)
- (Q5090494) (← links)
- Tight Lower Bounds for the Complexity of Multicoloring (Q5111704) (← links)
- On Parity Check (0,1)-Matrix over $\mathbb{Z}_p$ (Q5251659) (← links)
- Automatic structure recovery for additive models (Q5258430) (← links)
- Optimal channel utilization with limited feedback (Q5925513) (← links)
- Optimal schemes for combinatorial query problems with integer feedback (Q6138906) (← links)
- Approximate message passing with rigorous guarantees for pooled data and quantitative group testing (Q6633050) (← links)