Cody D. Murray

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Relations and equivalences between circuit lower bounds and karp-lipton theorems	2022-07-27	Paper
Circuit lower bounds for nondeterministic quasi-polytime from a new easy witness lemma SIAM Journal on Computing	2020-10-29	Paper
Easiness amplification and uniform circuit lower bounds	2020-05-26	Paper
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	2020-01-30	Paper
Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing	2019-08-22	Paper
On the (non) NP-hardness of computing circuit complexity	2018-01-24	Paper
On the (non) \(\mathsf{NP}\)-hardness of computing circuit complexity Theory of Computing	2017-10-11	Paper
Finding heavy hitters from lossy or noisy data Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques	2013-10-04	Paper

Research outcomes over time

This page was built for person: Cody D. Murray