Optimal query complexity bounds for finding graphs (Q991004): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:50, 5 March 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
