Optimal Query Complexity for Reconstructing Hypergraphs (Q3113744): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| label / en | label / en | ||
Optimal Query Complexity for Reconstructing Hypergraphs | |||
| Property / DOI | |||
| Property / DOI: 10.4230/LIPIcs.STACS.2010.2496 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2963710461 / rank | |||
Normal rank | |||
| Property / title | |||
Optimal Query Complexity for Reconstructing Hypergraphs (English) | |||
| Property / title: Optimal Query Complexity for Reconstructing Hypergraphs (English) / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.4230/LIPICS.STACS.2010.2496 / rank | |||
Normal rank | |||
Latest revision as of 16:57, 20 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal Query Complexity for Reconstructing Hypergraphs |
scientific article |
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
