Steven Homer

Publication Activity (10 Years)

Years Active: 1981-2019
Publications (10 Years): 3

Top Topics

Maximum Entropy

Policy Gradient

Top Venues

BNAIC/BENELEARN

Publications

Steven Homer
Maximum Entropy Bayesian Actor Critic. BNAIC/BENELEARN (2019)
Steven Homer
Learning Hierarchical Spectral Representations of Human Speech with the Information Dynamics of Thinking. BNAIC/BENELEARN (2019)
Stephen A. Fenner, Frederic Green, Steven Homer
Fixed-Parameter Extrapolation and Aperiodic Order: Open Problems. SIGACT News 49 (3) (2018)
Harry Buhrman, Benjamin J. Hescott, Steven Homer, Leen Torenvliet
Non-Uniform Reductions. Theory Comput. Syst. 47 (2) (2010)
Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer
Efficient universal quantum circuits. Quantum Inf. Comput. 10 (1&2) (2010)
Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer
Efficient Universal Quantum Circuits. COCOON (2009)
Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer
Universal Quantum Circuits CoRR (2008)
Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer
Universal Quantum Circuits. Electron. Colloquium Comput. Complex. 15 (078) (2008)
Debajyoti Bera, Frederic Green, Steven Homer
Small depth quantum circuits. SIGACT News 38 (2) (2007)
M. Fang, Stephen A. Fenner, Frederic Green, Steven Homer, Yong Zhang
Quantum lower bounds for fanout. Quantum Inf. Comput. 6 (1) (2006)
Stephen A. Fenner, Frederic Green, Steven Homer, Yong Zhang
Bounds on the Power of Constant-Depth Quantum Circuits. FCT (2005)
Lance Fortnow, Steven Homer
A Short History of Computational Complexity. Bull. EATCS 80 (2003)
Frederic Green, Steven Homer, Cristopher Moore, Christopher Pollett
Counting, fanout and the complexity of quantum ACC. Quantum Inf. Comput. 2 (1) (2002)
Stephen A. Fenner, Steven Homer, Randall Pruim, Marcus Schaefer
Hyper-polynomial hierarchies and the polynomial jump. Theor. Comput. Sci. 262 (1) (2001)
Frederic Green, Steven Homer, Chris Pollett
On the Complexity of Quantum ACC. Computational Complexity Conference (2000)
Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer
Complements of Multivalued Functions. Chic. J. Theor. Comput. Sci. 1999 (1999)
Stephen A. Fenner, Frederic Green, Steven Homer, Randall Pruim
Determining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy Electron. Colloquium Comput. Complex. 6 (3) (1999)
Steven Homer, Marcus Peinado
Design and Performance of Parallel and Distributed Approximation Algorithms for Maxcut. J. Parallel Distributed Comput. 46 (1) (1997)
Stephen A. Fenner, Steven Homer, Mitsunori Ogihara, Alan L. Selman
Oracles that Compute Values. SIAM J. Comput. 26 (4) (1997)
Zhixiang Chen, Steven Homer
Learning Counting Functions with Queries. Theor. Comput. Sci. 180 (1-2) (1997)
Stephen A. Fenner, Steven Homer, Randall Pruim, Marcus Schaefer
Hyper-Polynomial Hierarchies and the NP-Jump. Computational Complexity Conference (1997)
Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer
Complements of Multivalued Functions. Computational Complexity Conference (1996)
Judy Goldsmith, Steven Homer
Scalability and the Isomorphism Problem. Inf. Process. Lett. 57 (3) (1996)
Zhixiang Chen, Steven Homer
The Bounded Injury Priority Method and the Learnability of Unions of Rectangles. Ann. Pure Appl. Log. 77 (2) (1996)
Zhixiang Chen, Carlos Cunha, Steven Homer
Finding a Hidden Code by Asking Questions. COCOON (1996)
Nader H. Bshouty, Zhixiang Chen, Scott E. Decatur, Steven Homer
-DNF Formulas (Extended Abstract). COLT (1995)
Steven Homer, Marcus Peinado
A highly parallel algorithm to approximate MaxCut on distributed memory architectures. IPPS (1995)
Steven Homer, Sarah Mocas
Nonuniform Lower Bounds for Exponential Time Classes. MFCS (1995)
Klaus Ambos-Spies, Steven Homer, Robert I. Soare
Minimal Pairs and Complete Problems. Theor. Comput. Sci. 132 (2) (1994)
Steven Homer, Luc Longpré
On Reductions of NP Sets to Sparse Sets. J. Comput. Syst. Sci. 48 (2) (1994)
Nader H. Bshouty, Zhixiang Chen, Steven Homer
On Learning Discretized Geometric Concepts (Extended Abstract) FOCS (1994)
Steven Homer, Jie Wang
Immunity of Complete Problems Inf. Comput. 110 (1) (1994)
Zhixiang Chen, Steven Homer
On Learning Counting Functions with Queries. COLT (1994)
Stephen A. Fenner, Steven Homer, Mitsunori Ogiwara, Alan L. Selman
On Using Oracles That Compute Values. STACS (1993)
Eric Allender, Richard Beigel, Ulrich Hertrampf, Steven Homer
Almost-Everywhere Complexity Hierarchies for Nondeterministic Time. Theor. Comput. Sci. 115 (2) (1993)
Steven Homer, Stuart A. Kurtz, James S. Royer
On A-Truth-Table-Hard Languages. Theor. Comput. Sci. 115 (2) (1993)
Steven Homer, Marcus Peinado
Experiments with polynomial-time CLIQUE approximation algorithms on very large graphs. Cliques, Coloring, and Satisfiability (1993)
K. Ganesan, Steven Homer
Complete Problems and Strong Polynomial Reducibilities. SIAM J. Comput. 21 (4) (1992)
Harry Buhrman, Steven Homer
Superpolynomial Circuits, Almost Sparse Oracles and the Exponential Hierarchy. FSTTCS (1992)
Steven Homer, Alan L. Selman
Oracles for Structural Properties: The Isomorphism Problem and Public-Key Cryptography. J. Comput. Syst. Sci. 44 (2) (1992)
Harry Buhrman, Steven Homer, Leen Torenvliet
Completeness for Nondeterministic Complexity Classes. Math. Syst. Theory 24 (3) (1991)
Steven Homer, Luc Longpré
On Reductions of NP Sets to Sparse Sets. Computational Complexity Conference (1991)
Steven Homer
Structural Properties of Nondeterministic Complete Sets. Computational Complexity Conference (1990)
Klaus Ambos-Spies, Steven Homer, Robert I. Soare
Minimal Pairs and Complete Problems. STACS (1990)
Steven Homer
Setting standards in Europe. Comput. Secur. 9 (4) (1990)
Eric Allender, Richard Beigel, Ulrich Hertrampf, Steven Homer
A Note on the Almost-Everywhere Hierarchy for Nondeterministic Time. STACS (1990)
Rodney G. Downey, Steven Homer, William I. Gasarch, Michael F. Moses
On Honest Polynomial Reductions, Relativizations, and P=NP. Computational Complexity Conference (1989)
Steven Homer, Jie Wang
Absolute Results Concerning One-Way Functions and Their Applications. Math. Syst. Theory 22 (1) (1989)
Steven Homer, Alan L. Selman
Oracles for Structural Properties: The Isomorphism Problem and Public-Key Cryptography. Computational Complexity Conference (1989)
K. Ganesan, Steven Homer
Complete Problems and Strong Polynomial Reducibilities. STACS (1989)
Steven Homer, Timothy J. Long
Honest Polynomial Degrees and P=?NP. Theor. Comput. Sci. 51 (1987)
Steven Homer
Minimal degrees for polynomial reducibilities. J. ACM 34 (2) (1987)
Steven Homer
On Simple and Creative Sets in NP. Theor. Comput. Sci. 47 (3) (1986)
Steven Homer, John H. Reif
Arithmetic Theories for Computational Complexity Problems Inf. Control. 69 (1-3) (1986)
Steven Homer
On Simple and Creative Sets in NP. FSTTCS (1986)
Steven Homer
Minimal Degrees for Honest Polynomial Reducibilities FOCS (1984)
Steven Homer
Intermediate beta-R.E. Degrees and the Half-Jump. J. Symb. Log. 48 (3) (1983)
Steven Homer, Wolfgang Maass
Oracle-Dependent Properties of the Lattice of NP Sets. Theor. Comput. Sci. 24 (1983)
William I. Gasarch, Steven Homer
Relativizations Comparing NP and Exponential Time Inf. Control. 58 (1-3) (1983)
Jerry Goldman, Steven Homer
Quadratic Automata. J. Comput. Syst. Sci. 24 (2) (1982)
Steven Homer, Barry E. Jacobs
Degrees of Non α-Speedable Sets. Math. Log. Q. 27 (31-35) (1981)