Ramamohan Paturi 人物
相关论文查看全部 (3)
Which Problems Have Strongly Exponential Complexity?
2001Journal of Computer and System Sciences引用 1355
On the Complexity of k-SAT
2001Journal of Computer and System Sciences引用 1017
An improved exponential-time algorithm for <i>k</i> -SAT
2005Journal of the ACM引用 215
相关公司查看全部 (1)
University of California, San DiegoUNIVERSITY
相关事件
暂无数据
相关专利
暂无数据
相关文章
暂无数据