Cody Murray
According to our database1,
Cody Murray
authored at least 8 papers
between 2013 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2020
Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New Easy Witness Lemma.
SIAM J. Comput., 2020
2019
Electron. Colloquium Comput. Complex., 2019
Weak lower bounds on resource-bounded compression imply strong separations of complexity classes.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
2018
PhD thesis, 2018
2017
Circuit Lower Bounds for Nondeterministic Quasi-Polytime: An Easy Witness Lemma for NP and NQP.
Electron. Colloquium Comput. Complex., 2017
Proceedings of the 32nd Computational Complexity Conference, 2017
2014
Electron. Colloquium Comput. Complex., 2014
2013
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013