Toward a deterministic polynomial time algorithm with optimal additive query complexity (Q764325): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2011.09.005 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2011.09.005 / rank | |||
Normal rank | |||
Latest revision as of 03:09, 10 December 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
0 references
0 references
