Strategies for the fixed Renyi-Ulam Game with fixed number of lies

Deppe C (2004)
In: Theoretical Computer Science. Elsevier: 45-55.

Book Chapter | English

No fulltext has been uploaded

Publishing Year
PUB-ID

Cite this

Deppe C. Strategies for the fixed Renyi-Ulam Game with fixed number of lies. In: Theoretical Computer Science. Elsevier; 2004: 45-55.
Deppe, C. (2004). Strategies for the fixed Renyi-Ulam Game with fixed number of lies. Theoretical Computer Science, 45-55.
Deppe, C. (2004). “Strategies for the fixed Renyi-Ulam Game with fixed number of lies” in Theoretical Computer Science (Elsevier), 45-55.
Deppe, C., 2004. Strategies for the fixed Renyi-Ulam Game with fixed number of lies. In Theoretical Computer Science. Elsevier, pp. 45-55.
C. Deppe, “Strategies for the fixed Renyi-Ulam Game with fixed number of lies”, Theoretical Computer Science, Elsevier: 2004, pp.45-55.
Deppe, C.: Strategies for the fixed Renyi-Ulam Game with fixed number of lies. Theoretical Computer Science. p. 45-55. Elsevier (2004).
Deppe, Christian. “Strategies for the fixed Renyi-Ulam Game with fixed number of lies”. Theoretical Computer Science. Elsevier, 2004. 45-55.
This data publication is cited in the following publications:
This publication cites the following data publications:

Export

0 Marked Publications

Open Data PUB

Search this title in

Google Scholar