Folgen
Dylan McKay
Dylan McKay
Bestätigte E-Mail-Adresse bei mit.edu - Startseite
Titel
Zitiert von
Zitiert von
Jahr
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
102017
Relations and equivalences between circuit lower bounds and Karp-Lipton theorems
RR Williams, C Murray, L Chen, DM McKay
2019
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–5