The maximum size of a Sidon set contained in sparse random set of integers (2011)
Source: proceedings. Conference titles: ACM-SIAM Symposium on Discrete Algorithms. Unidade: IME
Assunto: ALGORITMOS
ABNT
KOHAYAKAWA, Yoshiharu e LEE, Sang June e RODL, Vojtech. The maximum size of a Sidon set contained in sparse random set of integers. 2011, Anais.. Philadelphia: SIAM, 2011. Disponível em: https://dl.acm.org/citation.cfm?id=2133050. Acesso em: 19 nov. 2024.APA
Kohayakawa, Y., Lee, S. J., & Rodl, V. (2011). The maximum size of a Sidon set contained in sparse random set of integers. In proceedings. Philadelphia: SIAM. Recuperado de https://dl.acm.org/citation.cfm?id=2133050NLM
Kohayakawa Y, Lee SJ, Rodl V. The maximum size of a Sidon set contained in sparse random set of integers [Internet]. proceedings. 2011 ;[citado 2024 nov. 19 ] Available from: https://dl.acm.org/citation.cfm?id=2133050Vancouver
Kohayakawa Y, Lee SJ, Rodl V. The maximum size of a Sidon set contained in sparse random set of integers [Internet]. proceedings. 2011 ;[citado 2024 nov. 19 ] Available from: https://dl.acm.org/citation.cfm?id=2133050