基本信息
浏览量:303
职业迁徙
个人简介
Professor Khot's specialty is computational complexity. This studies the inherent difficulty of computational tasks, attempting to determine which computational problems can be solved with little computation, which problems can be solved only with large amounts of computation, and which cannot be solved at all. The area has been intensely studied by theoretical computer scientists and mathematicians for fifty years, and is now a highly sophisticated, deep, and complex mathematical theory. A central question in this field is the so-called ``P=NP" question, which, despite intense study, still remains an open question.
研究兴趣
论文共 145 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
PROCEEDINGS OF THE 55TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2023pp.632-642, (2023)
2023 IEEE 64TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, FOCS (2023): 1337-1341
Electron. Colloquium Comput. Complex. (2023)
引用0浏览0EI引用
0
0
CoRR (2023)
引用0浏览0EI引用
0
0
CoRR (2023)
引用0浏览0EI引用
0
0
arXiv (Cornell University) (2023)
引用1浏览0引用
1
0
CCC '22: Proceedings of the 37th Computational Complexity Conferencepp.1-21, (2022)
引用0浏览0EI引用
0
0
加载更多
作者统计
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn