Cody Murray

According to our database, Cody Murray authored at least 8 papers between 2013 and 2020.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2020

Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New Easy Witness Lemma.

Cody D. Murray, R. Ryan Williams

SIAM J. Comput., 2020

2019

Relations and Equivalences Between Circuit Lower Bounds and Karp-Lipton Theorems.

Lijie Chen, Dylan M. McKay, Cody Murray, R. Ryan Williams

Electron. Colloquium Comput. Complex., 2019

Weak lower bounds on resource-bounded compression imply strong separations of complexity classes.

Dylan M. McKay, Cody D. Murray, R. Ryan Williams

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

2018

Connections between circuit analysis problems and circuit lower bounds.

Cody Murray

PhD thesis, 2018

2017

On the (Non) NP-Hardness of Computing Circuit Complexity.

Cody D. Murray, R. Ryan Williams

Theory Comput., 2017

Circuit Lower Bounds for Nondeterministic Quasi-Polytime: An Easy Witness Lemma for NP and NQP.

Cody Murray, R. Ryan Williams

Electron. Colloquium Comput. Complex., 2017

Easiness Amplification and Uniform Circuit Lower Bounds.

Cody D. Murray, R. Ryan Williams

Proceedings of the 32nd Computational Complexity Conference, 2017

2013

Finding Heavy Hitters from Lossy or Noisy Data.

Lucia Batman, Russell Impagliazzo, Cody Murray, Ramamohan Paturi

Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2013