Selected Research Papers - Steve Homer
Quantum Computation
Quantum Lower Bounds for Fanout
Bounds on the Power of Constant-Depth Quantum Circuits
Quantum NP is Hard for the PH
Complexity Theory
A Brief History of Complexity Theory
The Hyperpolynomial Hierarchy and the NP Jump
Structural Properties of Complete Problems for Exponential Time
Complements of Multivalued Functions
Priority Arguments in Beta-Recurion Theory (PhD Thesis)
Experimental Algorithms
On the Performance of Polynomial-time CLIQUE Approximation Algorithms on Very Large Graphs
Design and Performance of Parallel and Distributed Approximation Algorithms for Maxcut
Current CV
A full list of papers can be found in my CV