Steven Homer
Loading Google Thumbnails...
| 2010 |
|---|
| 8 | Non-Uniform Reductions. Harry Buhrman, Benjamin J. Hescott, Steven Homer, Leen Torenvliet. Theory Comput. Syst. (47): 317-341 (2010). Web SearchBibTeXDownload |
| 2006 |
|---|
| 7 | Quantum lower bounds for fanout. M. Fang, Stephen A. Fenner, Frederic Green, Steven Homer, Yong Zhang. Quantum Information & Computation (6): 46-57 (2006). Web SearchBibTeXDownload |
| 2005 |
|---|
| 6 | Bounds on the Power of Constant-Depth Quantum Circuits. Stephen A. Fenner, Frederic Green, Steven Homer, Yong Zhang. FCT 2005, 44-55. Web SearchBibTeXDownload |
| 2002 |
|---|
| 5 | Counting, fanout and the complexity of quantum ACC. Frederic Green, Steven Homer, Cristopher Moore, Christopher Pollett. Quantum Information & Computation (2): 35-65 (2002). Web SearchBibTeXDownload |
| 1997 |
|---|
| 4 | Oracles that Compute Values. Stephen A. Fenner, Steven Homer, Mitsunori Ogihara, Alan L. Selman. SIAM J. Comput. (26): 1043-1065 (1997). Web SearchBibTeXDownload |
| 1996 |
|---|
| 3 | Scalability and the Isomorphism Problem. Judy Goldsmith, Steven Homer. Inf. Process. Lett. (57): 137-143 (1996). Web SearchBibTeXDownload |
| 1991 |
|---|
| 2 | Completeness for Nondeterministic Complexity Classes. Harry Buhrman, Steven Homer, Leen Torenvliet. Mathematical Systems Theory (24): 179-200 (1991). Web SearchBibTeXDownload |
| 1983 |
|---|
| 1 | Oracle-Dependent Properties of the Lattice of NP Sets. Steven Homer, Wolfgang Maass. Theor. Comput. Sci. (24): 279-289 (1983). Web SearchBibTeXDownload |
from DBLP and Google Scholar
