de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

The Deterministic and Randomized Query Complexity of a Simple Guessing Game

MPS-Authors
http://pubman.mpdl.mpg.de/cone/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;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45021

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

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45750

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

Fulltext (public)
There are no public fulltexts available
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. Electronic Colloquium on Computational Complexity (ECCC): Report Series, 87, 1-33.


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