Optimal query complexity bounds for finding graphs (Q991004): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.artint.2010.02.003 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.ARTINT.2010.02.003 / rank | |||
Normal rank | |||
Latest revision as of 11:34, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal query complexity bounds for finding graphs |
scientific article |
Statements
Optimal query complexity bounds for finding graphs (English)
0 references
2 September 2010
0 references
combinatorial search
0 references
combinatorial group testing
0 references
graph finding
0 references
coin weighing
0 references
Fourier coefficient
0 references
pseudo-Boolean function
0 references
Littlewood-Offord theorem
0 references
0 references
0 references
