关注
Dylan McKay
Dylan McKay
PhD Student, Massachusetts Institute of Technology
在 mit.edu 的电子邮件经过验证 - 首页
标题
引用次数
引用次数
年份
Weak lower bounds on resource-bounded compression imply strong separations of complexity classes
DM McKay, CD Murray, RR Williams
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
402019
Relations and equivalences between circuit lower bounds and Karp-Lipton theorems
L Chen, DM McKay, CD Murray, RR Williams
34th Computational Complexity Conference (CCC 2019), 2019
282019
Quadratic time-space lower bounds for computing natural functions with a random oracle
DM McKay, RR Williams
10th Innovations in Theoretical Computer Science Conference (ITCS 2019), 2019
122019
Theoretical foundations of team matchmaking
J Alman, D McKay
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent …, 2017
122017
Relations and equivalences between circuit lower bounds and Karp-Lipton theorems
RR Williams, C Murray, L Chen, DM McKay
2019
系统目前无法执行此操作，请稍后再试。
文章 1–5
共建清朗的网络空间,如遇有害信息,请举报。
本站数据皆整合自互联网公开资源索引,方便科研学术方面查询,并不存储相关数据资源;如对此有异议,请联系我们解决.
© 2023 学术资源搜索   @联系我们 | 申请短期会员 | 数据源提交