The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity (Q4925265)
From MaRDI portal
scientific article; zbMATH DE number 6174180
Language | Label | Description | Also known as |
---|---|---|---|
English | The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity |
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