Sunflower theorems in monotone circuit complexity (2021)
Fonte: Anais. Nome do evento: Congresso da Sociedade Brasileira de Computação - CSBC. Unidade: IME
Assuntos: COMPUTABILIDADE E COMPLEXIDADE, COMBINATÓRIA
ABNT
CAVALAR, Bruno Pasqualotto e KOHAYAKAWA, Yoshiharu. Sunflower theorems in monotone circuit complexity. 2021, Anais.. Porto Alegre: SBC, 2021. Disponível em: https://doi.org/10.5753/ctd.2021.15761. Acesso em: 17 nov. 2024.APA
Cavalar, B. P., & Kohayakawa, Y. (2021). Sunflower theorems in monotone circuit complexity. In Anais. Porto Alegre: SBC. doi:10.5753/ctd.2021.15761NLM
Cavalar BP, Kohayakawa Y. Sunflower theorems in monotone circuit complexity [Internet]. Anais. 2021 ;[citado 2024 nov. 17 ] Available from: https://doi.org/10.5753/ctd.2021.15761Vancouver
Cavalar BP, Kohayakawa Y. Sunflower theorems in monotone circuit complexity [Internet]. Anais. 2021 ;[citado 2024 nov. 17 ] Available from: https://doi.org/10.5753/ctd.2021.15761