基本信息
views: 920

Bio
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.
Research Interests
Papers共 182 篇Author StatisticsCo-AuthorSimilar Experts
By YearBy Citation主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
IEEE Annual Symposium on Foundations of Computer Sciencepp.1388-1407, (2024)
ICLR 2024 (2024)
Cited0Views0Bibtex
0
0
TMLR 2024 (2024)
Cited0Views0EIBibtex
0
0
Electron. Colloquium Comput. Complex. (2023): 7:1-7:24
Cybersecurity and Cyberforensics Conferencepp.4:1-4:40, (2023)
arXiv (Cornell University) (2023): 104:1-104:12
Load More
Author Statistics
#Papers: 182
#Citation: 12057
H-Index: 48
G-Index: 108
Sociability: 6
Diversity: 2
Activity: 34
Co-Author
Co-Institution
D-Core
- 合作者
- 学生
- 导师
Data Disclaimer
The page data are from open Internet sources, cooperative publishers and automatic analysis results through AI technology. We do not make any commitments and guarantees for the validity, accuracy, correctness, reliability, completeness and timeliness of the page data. If you have any questions, please contact us by email: report@aminer.cn