The length of random subsets of Boolean lattices (2000)
Kohayakawa, Yoshiharu 
; Kreuter, Bernd; Osthus, Deryk
Source: Random Structures & Algorithms. Unidade: IME
Subjects: TEORIA DOS GRAFOS, COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
KOHAYAKAWA, Yoshiharu e KREUTER, Bernd e OSTHUS, Deryk. The length of random subsets of Boolean lattices. Random Structures & Algorithms, v. 16, n. 2, p. 177-194, 2000Tradução . . Disponível em: https://doi.org/10.1002/(SICI)1098-2418(200003)16:2<177::AID-RSA4>3.0.CO;2-9. Acesso em: 06 jul. 2024.APA
Kohayakawa, Y., Kreuter, B., & Osthus, D. (2000). The length of random subsets of Boolean lattices. Random Structures & Algorithms, 16( 2), 177-194. doi:10.1002/(SICI)1098-2418(200003)16:2<177::AID-RSA4>3.0.CO;2-9NLM
Kohayakawa Y, Kreuter B, Osthus D. The length of random subsets of Boolean lattices [Internet]. Random Structures & Algorithms. 2000 ; 16( 2): 177-194.[citado 2024 jul. 06 ] Available from: https://doi.org/10.1002/(SICI)1098-2418(200003)16:2<177::AID-RSA4>3.0.CO;2-9Vancouver
Kohayakawa Y, Kreuter B, Osthus D. The length of random subsets of Boolean lattices [Internet]. Random Structures & Algorithms. 2000 ; 16( 2): 177-194.[citado 2024 jul. 06 ] Available from: https://doi.org/10.1002/(SICI)1098-2418(200003)16:2<177::AID-RSA4>3.0.CO;2-9
