English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  The Deterministic and Randomized Query Complexity of a Simple Guessing Game

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.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-A450-8 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0025-062E-1
Genre: Journal Article

Files

show Files

Locators

show
hide
Locator:
http://eccc.hpi-web.de/report/2012/087/ (Any fulltext)
Description:
-
OA-Status:

Creators

show
hide
 Creators:
Afshani, Peyman1, Author
Agrawal, Manindra1, Author
Doerr, Benjamin2, Author           
Larsen, Kasper Green2, Author
Mehlhorn, Kurt2, Author           
Winzen, Carola2, Author           
Affiliations:
1External Organizations, ou_persistent22              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: Query complexity; randomized algorithms; guessing games; Mastermind
 Abstract: -

Details

show
hide
Language(s): eng - English
 Dates: 2012
 Publication Status: Published online
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: KurtECCC2012
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Electronic Colloquium on Computational Complexity (ECCC) : Report Series
  Abbreviation : ECCC
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: Potsdam : Hasso-Plattner-Institut für Softwaretechnik GmbH
Pages: - Volume / Issue: 87 Sequence Number: - Start / End Page: 1 - 33 Identifier: ISSN: 1433-8092