팔로우
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
382019
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
252019
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
112019
Theoretical foundations of team matchmaking
J Alman, D McKay
Proceedings of the 16th Conference on Autonomous Agents and MultiAgent …, 2017
112017
Relations and equivalences between circuit lower bounds and Karp-Lipton theorems
RR Williams, C Murray, L Chen, DM McKay
2019
현재 시스템이 작동되지 않습니다. 나중에 다시 시도해 주세요.
학술자료 1–5