基本信息
浏览量:25
职业迁徙
个人简介
Research Interests
Computational complexity theory and its connections to algorithms, combinatorics, and mathematical logic. In particular, over the last few years I have been involved with the following research directions:
Unconditional complexity lower bounds
Connecting the design of algorithms to complexity lower bounds
Computational pseudorandomness, probabilistic Kolmogorov complexity, and their applications
Hardness magnification: understanding the difficulty of proving weak lower bounds
Unprovability results in mathematical logic
Meta-complexity and NP-hardness of circuit minimisation and related problems
研究兴趣
论文共 50 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
CoRR (2023): 29:1-29:37
2023 IEEE 64TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, FOCS (2023): 1261-1270
PROCEEDINGS OF THE 55TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2023 (2023): 1051-1057
Electron. Colloquium Comput. Complex.no. 1 (2022): 159-60
加载更多
作者统计
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn