scientific article; zbMATH DE number 5485589
From MaRDI portal
Publication:5302100
zbMath1231.68150MaRDI QIDQ5302100
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (11)
Exact learning from an honest teacher that answers membership queries ⋮ Learning Boolean halfspaces with small weights from membership queries ⋮ Unnamed Item ⋮ Reconstructing weighted graphs with minimal query complexity ⋮ Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness ⋮ Optimal query complexity bounds for finding graphs ⋮ Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries ⋮ Toward a deterministic polynomial time algorithm with optimal additive query complexity ⋮ Reconstructing Weighted Graphs with Minimal Query Complexity ⋮ Topology discovery of sparse random graphs with few participants ⋮ On Parity Check (0,1)-Matrix over $\mathbb{Z}_p$
This page was built for publication:
