Optimal query complexity bounds for finding graphs (Q991004)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimal query complexity bounds for finding graphs |
scientific article; zbMATH DE number 5777560
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal query complexity bounds for finding graphs |
scientific article; zbMATH DE number 5777560 |
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
0.8497834205627441
0 references
0.8263346552848816
0 references
0.8249641060829163
0 references
0.8202256560325623
0 references
0.8180422186851501
0 references
