| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Stephen A. Fenner |
Functions that preserve p-randomness  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Stephen A. Fenner |
Functions That Preserve p-Randomness. |
FCT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer |
Efficient universal quantum circuits. |
Quantum Information & Computation |
2010 |
DBLP BibTeX RDF |
|
| 1 | Stephen A. Fenner, William I. Gasarch, Brian Postow |
The complexity of learning SUBSEQ(A). |
J. Symb. Log. |
2009 |
DBLP BibTeX RDF |
|
| 1 | Stephen A. Fenner, William I. Gasarch, Brian Postow |
The Complexity of Finding SUBSEQ(A). |
Theory Comput. Syst. |
2009 |
DBLP DOI BibTeX RDF |
Turing degree, Higman’s lemma, Unbounded search, Recursive mathematics, Computational complexity, Computability, Context-free grammar, Automata theory, Automaton, Context-free language, Subsequence, Reverse mathematics, Bounded queries |
| 1 | Debajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer |
Efficient Universal Quantum Circuits. |
COCOON |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Fenner, William I. Gasarch, Brian Postow |
The complexity of learning SUBSEQ(A). |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP 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 | Stephen A. Fenner, Yong Zhang |
On the Complexity of the Hidden Subgroup Problem. |
TAMC |
2008 |
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, Yong Zhang |
The central nature of the Hidden Subgroup problem |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Stephen A. Fenner, William I. Gasarch |
The Complexity of Learning SUBSEQ (A). |
ALT |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Fenner, Jack H. Lutz, Elvira Mayordomo, Patrick Reardon |
Weakly useful sequences. |
Inf. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Fenner, Yong Zhang |
Quantum Algorithms for a Set of Group Theoretic Problems. |
ICTCS |
2005 |
DBLP DOI 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 | Marcus Schaefer, Stephen A. Fenner |
Simplicity and Strong Reductions |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Stephen A. Fenner, Stuart A. Kurtz, James S. Royer |
Every polynomial-time 1-degree collapses if and only if P = PSPACE. |
J. Symb. Log. |
2004 |
DBLP BibTeX RDF |
|
| 1 | Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers |
Inverting onto functions. |
Inf. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz, Lide Li |
An oracle builder's toolkit. |
Inf. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Fenner |
A Physics-Free Introduction to the Quantum Computation Model |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | Stephen A. Fenner |
A physics-free introduction to the quantum computation model, Computational Complexity Column. |
Bulletin of the EATCS |
2003 |
DBLP BibTeX RDF |
|
| 1 | Stephen A. Fenner |
PP-Lowness and a Simple Definition of AWPP. |
Theory Comput. Syst. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Fenner |
PP-lowness and a simple definition of AWPP |
Electronic Colloquium on Computational Complexity (ECCC) |
2002 |
DBLP BibTeX RDF |
|
| 1 | Stephen A. Fenner |
Gales and supergales are equivalent for defining constructive Hausdorff dimension |
CoRR |
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 | Harry Buhrman, Stephen A. Fenner, Lance Fortnow, Leen Torenvliet |
Two oracles that force a big crunch. |
Computational Complexity |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry Buhrman, Stephen A. Fenner, Lance Fortnow, Dieter van Melkebeek |
Optimal Proof Systems and Sparse Sets. |
STACS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Fenner, Marcus Schaefer |
Bounded Immunity and Btt-Reductions. |
Math. Log. Q. |
1999 |
DBLP 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 | Stephen A. Fenner, Steven Homer, Mitsunori Ogihara, Alan L. Selman |
Oracles that Compute Values. |
SIAM J. Comput. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Harry Buhrman, Stephen A. Fenner, Lance Fortnow |
Results on Resource-Bounded Measure. |
ICALP |
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 | Stephen A. Fenner, Lance Fortnow, Lide Li |
Gap-Definability as a Closure Property. |
Inf. Comput. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Fenner, Lance Fortnow, William I. Gasarch |
Complexity Theory Newsflash. |
SIGACT News |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz |
The Isomorphism Conjecture Holds Relative to an Oracle. |
SIAM J. Comput. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers |
Inverting Onto Functions. (PDF / PS) |
IEEE Conference on Computational Complexity |
1996 |
DBLP DOI BibTeX RDF |
function classes, total functions, nondeterministic Turing machines, unambiguous computation, Computational complexity, invertibility |
| 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 | Stephen A. Fenner, Jack H. Lutz, Elvira Mayordomo |
Weakly Useful Sequences. |
ICALP |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Fenner, Lance Fortnow |
Beyond P^(NP) - NEXP. |
STACS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Fenner |
Inverting the Turing Jump in Complexity Theory. |
Structure in Complexity Theory Conference |
1995 |
DBLP BibTeX RDF |
|
| 1 | Stephen A. Fenner |
Resource-Bounded Baire Category: A Stronger Approach. |
Structure in Complexity Theory Conference |
1995 |
DBLP BibTeX RDF |
|
| 1 | Stephen A. Fenner |
Almost Weakly 2-Generic Sets. |
J. Symb. Log. |
1994 |
DBLP BibTeX RDF |
|
| 1 | Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz |
Gap-Definable Counting Classes. |
J. Comput. Syst. Sci. |
1994 |
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 | Stephen A. Fenner, Lance Fortnow, Lide Li |
Gap-Definability as a Closure Property. |
STACS |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz, Lide Li |
An Oarcle Builder's Toolkit. |
Structure in Complexity Theory Conference |
1993 |
DBLP BibTeX RDF |
|
| 1 | Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz |
The Isomorphism Conjecture Holds Relative to an Oracle |
FOCS |
1992 |
DBLP DOI BibTeX RDF |
symmetric perfect generic sets, isomorphism conjecture, NP completeness, oracle |
| 1 | Stephen A. Fenner |
Notions of Resource-Bounded Category and Genericity. |
Structure in Complexity Theory Conference |
1991 |
DBLP BibTeX RDF |
|
| 1 | Stephen A. Fenner, Lance Fortnow, Stuart A. Kurtz |
Gap-Definable Counting Classes. |
Structure in Complexity Theory Conference |
1991 |
DBLP BibTeX RDF |
|
| 1 | Stephen A. Fenner, Stuart A. Kurtz, James S. Royer |
Every Polynomial-Time 1-Degree Collapses iff P=PSPACE |
FOCS |
1989 |
DBLP DOI BibTeX RDF |
equivalent sets, m-reducible, Karp-reducible, polynomial-time computable function |
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")