Toward a deterministic polynomial time algorithm with optimal additive query complexity (Q764325): Difference between revisions
From MaRDI portal
Latest revision as of 23:28, 4 July 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