基本信息
浏览量:235
职业迁徙
个人简介
Teaching
Computer Science
Theory of computation
Computational complexity
Complexity classes (time, space, nondeterminism)
Space complexity (Logspace, L vs NL)
Boolean circuits and nonuniform computation
Power of randomness (interactive proofs)
Lower bounds for concrete models of computation: Decision trees, communication protocols, propositional proofs.
Computer Science
Theory of computation
Computational complexity
Complexity classes (time, space, nondeterminism)
Space complexity (Logspace, L vs NL)
Boolean circuits and nonuniform computation
Power of randomness (interactive proofs)
Lower bounds for concrete models of computation: Decision trees, communication protocols, propositional proofs.
研究兴趣
论文共 66 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
IACR Cryptol. ePrint Arch. (2024): 50:1-50:14
SIAM JOURNAL ON COMPUTINGno. 6 (2023): 316-348
2023 IEEE 64TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, FOCS (2023): 1048-1055
MFCS (2023): 51:1-51:12
引用0浏览0EI引用
0
0
Electron. Colloquium Comput. Complex. (2023)
引用0浏览0EI引用
0
0
International Workshop Randomization and Approximation Techniques in Computer Science (RANDOM) (2022): 19:1-19:9
加载更多
作者统计
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn