"The String Guessing Problem as a Method to Prove Lower Bounds on the ..."

Hans-Joachim Böckenhauer et al. (2013)

> Home

Details and statistics

DOI: 10.1007/978-3-642-38768-5_44

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cocoon/BockenhauerHKKSS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoon/BockenhauerHKKSS13
Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Sacha Krug, Jasmin Smula, Andreas Sprock:
The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity. COCOON 2013: 493-505

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.