Optimal query complexity bounds for finding graphs (Q991004): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.artint.2010.02.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2048252940 / rank | |||
Normal rank | |||
Revision as of 01:16, 20 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
