基本信息
浏览量:917
职业迁徙
个人简介
My primary research area is computational complexity. The central problem in computational complexity is to understand which computational problems can be solved efficiently, and to develop the most efficient, least costly algorithms for such problems. Efficiency and cost is measured in terms of three computational resources: time, space and randomness. The goal is to understand how much of these resources are required to solve important computational problems, and to understand the relationships and tradeoffs between the resources. The most famous problem in the area, the P versus NP problem, is the driving force behind much of my research.
One important direction aimed at ultimately resolving the P versus NP question is propositional proof complexity. The central problem in proof complexity is to understand which tautologies have efficient proofs in standard proof systems. There are two aspects to this endeavor: (1) developing new algorithms and proof systems for propositional tautology/satisfiability testing, and (2) proving lower bounds for standard proof systems. These endeavors are related not only to worst-case complexity, but also to the study and analysis of standard heuristics for NP-hard problems. Proof complexity has other rich connections to complexity theory and cryptography, as well as applications to theorem proving and artificial intelligence.
One important direction aimed at ultimately resolving the P versus NP question is propositional proof complexity. The central problem in proof complexity is to understand which tautologies have efficient proofs in standard proof systems. There are two aspects to this endeavor: (1) developing new algorithms and proof systems for propositional tautology/satisfiability testing, and (2) proving lower bounds for standard proof systems. These endeavors are related not only to worst-case complexity, but also to the study and analysis of standard heuristics for NP-hard problems. Proof complexity has other rich connections to complexity theory and cryptography, as well as applications to theorem proving and artificial intelligence.
研究兴趣
论文共 201 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
Electron. Colloquium Comput. Complex. (2023): 7:1-7:24
引用0浏览0EI引用
0
0
CoRR (2023): 58:1-58:23
CoRR (2023): 1-40
引用0浏览0EI引用
0
0
PROCEEDINGS OF THE 55TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2023 (2023): 520-527
Electron. Colloquium Comput. Complex. (2022): 89:1-89:19
引用0浏览0EI引用
0
0
arxiv(2022)
引用0浏览0EI引用
0
0
加载更多
作者统计
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn