Optimal Query Complexity for Reconstructing Hypergraphs

DOI10.4230/LIPICS.STACS.2010.2496zbMath1230.68101OpenAlexW2963710461MaRDI QIDQ3113744

Hanna Mazzawi, Nader H. Bshouty

Publication date: 23 January 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_1161.html

zbMATH Keywords

hypergraphsquery complexityreconstruction of hidden weighted hypergraphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65)

Related Items (1)

Exact learning from an honest teacher that answers membership queries

This page was built for publication: Optimal Query Complexity for Reconstructing Hypergraphs