关注
Prateek Dwivedi
Prateek Dwivedi
PhD Student, IIT Kanpur
在 cse.iitk.ac.in 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
Deterministic identity testing paradigms for bounded top-fanin depth-4 circuits
P Dutta, P Dwivedi, N Saxena
36th Computational Complexity Conference (CCC 2021), 2021
172021
Demystifying the border of depth-3 algebraic circuits
P Dutta, P Dwivedi, N Saxena
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
152022
Lower Bounds for the Sum of Small-Size Algebraic Branching Programs
CS Bhargav, P Dwivedi, N Saxena
Annual Conference on Theory and Applications of Models of Computation, 355-366, 2024
22024
Learning the Coefficients: A Presentable Version of Border Complexity and Applications to Circuit Factoring
CS Bhargav, P Dwivedi, N Saxena
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 130-140, 2024
2024
系统目前无法执行此操作，请稍后再试。
文章 1–4
共建清朗的网络空间,如遇有害信息,请举报。
本站数据皆整合自互联网公开资源索引,方便科研学术方面查询,并不存储相关数据资源;如对此有异议,请联系我们解决.
© 2023 学术资源搜索   @联系我们 | 申请短期会员 | 数据源提交