The following pages link to (Q5302100):
Displayed 8 items.
- Toward a deterministic polynomial time algorithm with optimal additive query complexity (Q764325) (← links)
- Optimal query complexity bounds for finding graphs (Q991004) (← links)
- Reconstructing weighted graphs with minimal query complexity (Q2431425) (← links)
- Topology discovery of sparse random graphs with few participants (Q2844081) (← links)
- Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries (Q3087620) (← 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)
- On Parity Check (0,1)-Matrix over $\mathbb{Z}_p$ (Q5251659) (← links)