The Deterministic and Randomized Query Complexity of a Simple Guessing Game

Afshani, Peyman and Agrawal, Manindra and Doerr, Benjamin and Winzen, Carola and Larsen, Kasper Green and Mehlhorn, Kurt
(2012) The Deterministic and Randomized Query Complexity of a Simple Guessing Game.
Electronic Colloquium on Computational Complexity (ECCC), 19. p. 87.

Full text not available from this repository.
Item Type: Article
Depositing User: Sebastian Weisgerber
Date Deposited: 22 Feb 2018 11:11
Last Modified: 22 Feb 2018 15:53
URI: https://publications.cispa.saarland/id/eprint/1661

Actions

Actions (login required)

View Item View Item
CISPA is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.