Rahul Ilango
AuthID: R-00J-E3M
1
TÃTULO: Hardness of Constant-Round Communication Complexity
AUTORES: Shuichi Hirahara; Rahul Ilango; Bruno Loff ;
PUBLICAÇÃO: 2021, FONTE: 36th Computational Complexity Conference, CCC 2021 in 36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference)., VOLUME: 200
AUTORES: Shuichi Hirahara; Rahul Ilango; Bruno Loff ;
PUBLICAÇÃO: 2021, FONTE: 36th Computational Complexity Conference, CCC 2021 in 36th Computational Complexity Conference, CCC 2021, July 20-23, 2021, Toronto, Ontario, Canada (Virtual Conference)., VOLUME: 200
INDEXADO EM:
Scopus
DBLP


2
TÃTULO: NP-Hardness of Circuit Minimization for Multi-Output Functions
AUTORES: Rahul Ilango; Bruno Loff ; Igor Carboni Oliveira;
PUBLICAÇÃO: 2020, FONTE: 35th Computational Complexity Conference, CCC 2020 in 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., VOLUME: 169
AUTORES: Rahul Ilango; Bruno Loff ; Igor Carboni Oliveira;
PUBLICAÇÃO: 2020, FONTE: 35th Computational Complexity Conference, CCC 2020 in 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., VOLUME: 169
INDEXADO EM:
Scopus
DBLP

