Sunflower theorems in monotone circuit complexity (2021)
- Authors:
- Autor USP: KOHAYAKAWA, YOSHIHARU - IME
- Unidade: IME
- DOI: 10.5753/ctd.2021.15761
- Subjects: COMPUTABILIDADE E COMPLEXIDADE; COMBINATÓRIA
- Language: Inglês
- Imprenta:
- Publisher: SBC
- Publisher place: Porto Alegre
- Date published: 2021
- Source:
- Conference titles: Congresso da Sociedade Brasileira de Computação - CSBC
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
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: 09 fev. 2026. -
APA
Cavalar, B. P., & Kohayakawa, Y. (2021). Sunflower theorems in monotone circuit complexity. In Anais. Porto Alegre: SBC. doi:10.5753/ctd.2021.15761 -
NLM
Cavalar BP, Kohayakawa Y. Sunflower theorems in monotone circuit complexity [Internet]. Anais. 2021 ;[citado 2026 fev. 09 ] Available from: https://doi.org/10.5753/ctd.2021.15761 -
Vancouver
Cavalar BP, Kohayakawa Y. Sunflower theorems in monotone circuit complexity [Internet]. Anais. 2021 ;[citado 2026 fev. 09 ] Available from: https://doi.org/10.5753/ctd.2021.15761 - Weak hypergraph regularity and linear hypergraphs
- Property testing and parameter testing for permutations
- The induced size-Ramsey number of cycles
- An extension of the blow-up lemma to arrangeable graphs
- The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
- Regular pairs in sparse random graphs I
- Powers of Hamilton cycles in pseudorandom graphs
- An unstable hypergraph problem with a unique optimal solution
- Turán's extremal problem in random graphs: forbidding even cycles
- Special issue on Ramsey theory. [Editorial]
Informações sobre o DOI: 10.5753/ctd.2021.15761 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
| 3057141.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
