Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. Alon, N., Beigel, R., Kasif, S., Rudich, S., Sudakov, B.: Learning a Hidden Matching. In: Proceedings of the 43rd IEEE FOCS 2002, pp. 197–206 (2002)
2. Alon, N., Spencer, J.H.: The Probabilistic Method, 2nd edn. Wiley, New York (2000)
3. Bollobás, B.: Random Graphs. Academic Press, London (1985)
4. Dyachkov, G., Rykov, V.V.: Bounds on the Length of Disjunctive Codes. Problemy Peredachi Informatsii 18(3), 158–166 (1982)
5. Grebinski, V., Kucherov, G.: Optimal Query Bounds for Reconstructing a Hamiltonian Cycle in Complete Graphs. In: Proc. 5th Israeli Symposium on Theoretical Computer Science, pp. 166–173 (1997)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献