Optimal query complexity for reconstructing hypergraphs (Q3113744)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5999692
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal query complexity for reconstructing hypergraphs |
scientific article; zbMATH DE number 5999692 |
Statements
23 January 2012
0 references
query complexity
0 references
hypergraphs
0 references
reconstruction of hidden weighted hypergraphs
0 references
Optimal Query Complexity for Reconstructing Hypergraphs (English)
0 references
0.8939616680145264
0 references
0.8843978643417358
0 references
0.8797853589057922
0 references
0.8148331046104431
0 references
0.8005610108375549
0 references
