| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Steven Homer, Alan L. Selman |
Computability and Complexity Theory, Second Edition.  |
|
2011 |
DOI RDF |
|
| 1 | Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer |
Efficient universal quantum circuits. |
Quantum Information & Computation  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Harry Buhrman, Benjamin J. Hescott, Steven Homer, Leen Torenvliet |
Non-Uniform Reductions. |
Theory Comput. Syst. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer |
Efficient Universal Quantum Circuits. |
COCOON |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer |
Universal Quantum Circuits. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer |
Universal Quantum Circuits |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Debajyoti Bera, Frederic Green, Steven Homer |
Small depth quantum circuits. |
SIGACT News |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | M. Fang, Stephen A. Fenner, Frederic Green, Steven Homer, Yong Zhang |
Quantum lower bounds for fanout. |
Quantum Information & Computation |
2006 |
DBLP BibTeX RDF |
|
| 1 | Stephen A. Fenner, Frederic Green, Steven Homer, Yong Zhang |
Bounds on the Power of Constant-Depth Quantum Circuits. |
FCT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Lance Fortnow, Steven Homer |
A Short History of Computational Complexity. |
Bulletin of the EATCS |
2003 |
DBLP BibTeX RDF |
|
| 1 | Frederic Green, Steven Homer, Cristopher Moore, Christopher Pollett |
Counting, fanout and the complexity of quantum ACC. |
Quantum Information & Computation |
2002 |
DBLP BibTeX RDF |
|
| 1 | Stephen A. Fenner, Steven Homer, Randall Pruim, Marcus Schaefer |
Hyper-polynomial hierarchies and the polynomial jump. |
Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Green, Steven Homer, Chris Pollett |
On the Complexity of Quantum ACC. (PDF / PS) |
IEEE Conference on Computational Complexity |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Fenner, Frederic Green, Steven Homer, Randall Pruim |
Determining Acceptance Possibility for a Quantum Computation is Hard for the Polynomial Hierarchy |
Electronic Colloquium on Computational Complexity (ECCC) |
1999 |
DBLP BibTeX RDF |
|
| 1 | Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer |
Complements of Multivalued Functions. |
Chicago J. Theor. Comput. Sci. |
1999 |
DBLP BibTeX RDF |
|
| 1 | Zhixiang Chen, Steven Homer |
Learning Counting Functions with Queries. |
Theor. Comput. Sci. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Steven Homer, Marcus Peinado |
Design and Performance of Parallel and Distributed Approximation Algorithms for Maxcut. |
J. Parallel Distrib. Comput. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Fenner, Steven Homer, Mitsunori Ogihara, Alan L. Selman |
Oracles that Compute Values. |
SIAM J. Comput. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Fenner, Steven Homer, Randall Pruim, Marcus Schaefer |
Hyper-Polynomial Hierarchies and the NP-Jump. (PDF / PS) |
IEEE Conference on Computational Complexity |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Judy Goldsmith, Steven Homer |
Scalability and the Isomorphism Problem. |
Inf. Process. Lett. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhixiang Chen, Steven Homer |
The Bounded Injury Priority Method and the Learnability of Unions of Rectangles. |
Ann. Pure Appl. Logic |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhixiang Chen, Carlos Cunha, Steven Homer |
Finding a Hidden Code by Asking Questions. |
COCOON |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, Heribert Vollmer |
Complements of Multivalued Functions. (PDF / PS) |
IEEE Conference on Computational Complexity |
1996 |
DBLP DOI BibTeX RDF |
multivalued functions, NPMV functions, coNPMV, complete functions, query hierarchy, functional analogue, Boolean hierarchy, computational complexity, complexity, multivalued logic, polynomial time hierarchy |
| 1 | Steven Homer, Marcus Peinado |
A highly parallel algorithm to approximate MaxCut on distributed memory architectures. (PDF / PS) |
IPPS |
1995 |
DBLP DOI BibTeX RDF |
MaxCut, maximum weight cut, weighted undirected graph, linear speedup, parallel algorithms, parallel algorithm, graph theory, distributed memory systems, distributed memory architectures, Connection Machine |
| 1 | Steven Homer, Sarah Mocas |
Nonuniform Lower Bounds for Exponential Time Classes. |
MFCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Zhixiang Chen, Scott E. Decatur, Steven Homer |
On the Learnability of Zn-DNF Formulas (Extended Abstract). |
COLT |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Steven Homer, Robert I. Soare |
Minimal Pairs and Complete Problems. |
Theor. Comput. Sci. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Steven Homer, Jie Wang |
Immunity of Complete Problems |
Inf. Comput. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Steven Homer, Luc Longpré |
On Reductions of NP Sets to Sparse Sets. |
J. Comput. Syst. Sci. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhixiang Chen, Steven Homer |
On Learning Counting Functions with Queries. |
COLT |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Nader H. Bshouty, Zhixiang Chen, Steven Homer |
On Learning Discretized Geometric Concepts (Extended Abstract) |
FOCS |
1994 |
DBLP DOI BibTeX RDF |
finite injury priority method, online learning algorithm, geometric concept, discretized geometric concepts, classes of rectangles, polynomial time, PAC-learning, equivalence queries, halfspaces |
| 1 | Steven Homer, Stuart A. Kurtz, James S. Royer |
On A-Truth-Table-Hard Languages. |
Theor. Comput. Sci. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Allender, Richard Beigel, Ulrich Hertrampf, Steven Homer |
Almost-Everywhere Complexity Hierarchies for Nondeterministic Time. |
Theor. Comput. Sci. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Fenner, Steven Homer, Mitsunori Ogiwara, Alan L. Selman |
On Using Oracles That Compute Values. |
STACS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Steven Homer, Uwe Schöning (eds.) |
Complexity Theory: Current Research, Dagstuhl Workshop, February 2-8, 1992 |
Complexity Theory: Current Research |
1993 |
DBLP BibTeX RDF |
|
| 1 | Steven Homer, Alan L. Selman |
Oracles for Structural Properties: The Isomorphism Problem and Public-Key Cryptography. |
J. Comput. Syst. Sci. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Ganesan, Steven Homer |
Complete Problems and Strong Polynomial Reducibilities. |
SIAM J. Comput. |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry Buhrman, Steven Homer |
Superpolynomial Circuits, Almost Sparse Oracles and the Exponential Hierarchy. |
FSTTCS |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry Buhrman, Steven Homer, Leen Torenvliet |
Completeness for Nondeterministic Complexity Classes. |
Mathematical Systems Theory |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Steven Homer, Luc Longpré |
On Reductions of NP Sets to Sparse Sets. |
Structure in Complexity Theory Conference |
1991 |
DBLP BibTeX RDF |
|
| 1 | Steven Homer |
Setting standards in Europe. |
Computers & Security |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Steven Homer, Robert I. Soare |
Minimal Pairs and Complete Problems. |
STACS |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Allender, Richard Beigel, Ulrich Hertrampf, Steven Homer |
A Note on the Almost-Everywhere Hierarchy for Nondeterministic Time. |
STACS |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Steven Homer |
Structural Properties of Nondeterministic Complete Sets. |
Structure in Complexity Theory Conference |
1990 |
DBLP BibTeX RDF |
|
| 1 | Steven Homer, Jie Wang |
Absolute Results Concerning One-Way Functions and Their Applications. |
Mathematical Systems Theory |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | K. Ganesan, Steven Homer |
Complete Problems and Strong Polynomial Reducibilities. |
STACS |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Steven Homer, Alan L. Selman |
Oracles for Structural Properties: The Isomorphism Problem and Public-Key Cryptography. |
Structure in Complexity Theory Conference |
1989 |
DBLP BibTeX RDF |
|
| 1 | Rodney G. Downey, Steven Homer, William I. Gasarch, Michael Moses |
On Honest Polynomial Reductions, Relativizations, and P=NP. |
Structure in Complexity Theory Conference |
1989 |
DBLP BibTeX RDF |
|
| 1 | Steven Homer, Timothy J. Long |
Honest Polynomial Degrees and P=?NP. |
Theor. Comput. Sci. |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Steven Homer |
Minimal degrees for polynomial reducibilities. |
J. ACM |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Steven Homer |
On Simple and Creative Sets in NP. |
Theor. Comput. Sci. |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Steven Homer, John H. Reif |
Arithmetic Theories for Computational Complexity Problems |
Information and Control |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Steven Homer |
On Simple and Creative Sets in NP. |
FSTTCS |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Steven Homer |
Minimal Degrees for Honest Polynomial Reducibilities |
FOCS |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Steven Homer, Wolfgang Maass |
Oracle-Dependent Properties of the Lattice of NP Sets. |
Theor. Comput. Sci. |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | William I. Gasarch, Steven Homer |
Relativizations Comparing NP and Exponential Time |
Information and Control |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Steven Homer |
Intermediate beta-R.E. Degrees and the Half-Jump. |
J. Symb. Log. |
1983 |
DBLP BibTeX RDF |
|
| 1 | Jerry Goldman, Steven Homer |
Quadratic Automata. |
J. Comput. Syst. Sci. |
1982 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")