Cody Murray is a research Fellow studying complexity theory at the Simons Institute for the Theory of Computing. He is interested in circuit complexity and circuit analysis problems, that is, algorithms which analyze Boolean functions given as input. The analysis of such problems can lead to new lower bounds; for example, a faster satisfiability algorithm for a particular circuit class can lead to new NP lower bounds against that class. Another circuit analysis problem, MCSP, is in NP but not known to be NP-complete, and in fact is not NP-hard under some limited reduction models.
- Lower Bounds in Computational Complexity, Fall 2018. Research Fellow.