Back to the list of the institutes
Publications
Conference: 25th International Workshop on Combinatorial Algorithms
Number of publications: 12015
- Marcin Peczarski , Gerold Jäger, Playing several variants of mastermind with constant-size memory is not harder than with unbounded memory, Lecture Notes in Computer Science, 25th International Workshop on Combinatorial Algorithms, 8986 2015, p. 188–199. See in PBN
You are not logged in |