Toward a Deterministic Polynomial Time Algorithm with Optimal Additive Query Complexity (Q3586086)
From MaRDI portal
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
3 September 2010
0 references
