Toward a deterministic polynomial time algorithm with optimal additive query complexity (Q3586086)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5779291
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Toward a deterministic polynomial time algorithm with optimal additive query complexity |
scientific article; zbMATH DE number 5779291 |
Statements
Toward a Deterministic Polynomial Time Algorithm with Optimal Additive Query Complexity (English)
0 references
3 September 2010
0 references
0.9960448145866394
0 references
0.8327870965003967
0 references
0.8180422186851501
0 references
0.8147013783454895
0 references
