Toward a deterministic polynomial time algorithm with optimal additive query complexity (Q764325): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2011.09.005 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1978657617 / rank | |||
Normal rank | |||
Revision as of 00:23, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Toward a deterministic polynomial time algorithm with optimal additive query complexity |
scientific article |
Statements
Toward a deterministic polynomial time algorithm with optimal additive query complexity (English)
0 references
13 March 2012
0 references
combinatorial search
0 references
coin weighing problem
0 references
reconstructing hidden graphs
0 references
