English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  DetailsSummary

Released
Report

The Deterministic and Randomized Query Complexity of a Simple Guessing Game

MPS-Authors
/persons/resource/persons44338

Doerr,  Benjamin
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Larsen,  Kasper Green
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45021

Mehlhorn,  Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45750

Winzen,  Carola
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

http://eccc.hpi-web.de/report/2012/087/
(Any fulltext)

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Afshani, P., Agrawal, M., Doerr, B., Larsen, K. G., Mehlhorn, K., & Winzen, C.(2012). The Deterministic and Randomized Query Complexity of a Simple Guessing Game. [s.l.]: HPI.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0024-A450-8
Abstract
There is no abstract available