关注
Tulasimohan Molli
Tulasimohan Molli
LASIGE, Informática, Faculdade de Ciências, Universidade de Lisboa
在 fc.ul.pt 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
Tight chang’s-lemma-type bounds for boolean functions
S Chakraborty, NS Mande, R Mittal, T Molli, M Paraashar, S Sanyal
41st IARCS Annual Conference on Foundations of Software Technology and …, 2021
32021
On the Probabilistic Degree of OR over the Reals
S Bhandari, P Harsha, T Molli, S Srinivasan
Random Structures & Algorithms 59 (1), 53-67, 2021
22021
Criticality of AC 0-Formulae
P Harsha, T Molli, A Shankar
38th Computational Complexity Conference, 2023
12023
Criticality of AC⁰-Formulae
P Harsha, T Molli, A Shankar
38th Computational Complexity Conference (CCC 2023), 2023
2023
系统目前无法执行此操作,请稍后再试。
文章 1–4