The string guessing problem as a method to prove lower bounds on the advice complexity (extended abstract) (Q4925265)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The string guessing problem as a method to prove lower bounds on the advice complexity (extended abstract) |
scientific article; zbMATH DE number 6174180
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The string guessing problem as a method to prove lower bounds on the advice complexity (extended abstract) |
scientific article; zbMATH DE number 6174180 |
Statements
The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity (English)
0 references
11 June 2013
0 references
0.9974034428596495
0 references
0.8559238314628601
0 references
0.8426486849784851
0 references
0.8253656625747681
0 references
0.8209028244018555
0 references
