2008 |
43 | EE | Stephen A. Fenner,
Yong Zhang:
On the Complexity of the Hidden Subgroup Problem.
TAMC 2008: 70-81 |
42 | EE | Debajyoti Bera,
Stephen A. Fenner,
Frederic Green,
Steven Homer:
Universal Quantum Circuits
CoRR abs/0804.2429: (2008) |
41 | EE | Stephen A. Fenner,
William I. Gasarch,
Brian Postow:
The complexity of learning SUBSEQ(A).
Electronic Colloquium on Computational Complexity (ECCC) 15(053): (2008) |
40 | EE | Debajyoti Bera,
Stephen A. Fenner,
Frederic Green,
Steven Homer:
Universal Quantum Circuits.
Electronic Colloquium on Computational Complexity (ECCC) 15(078): (2008) |
2006 |
39 | EE | Stephen A. Fenner,
William I. Gasarch:
The Complexity of Learning SUBSEQ (A).
ALT 2006: 109-123 |
38 | EE | Stephen A. Fenner,
Yong Zhang:
The central nature of the Hidden Subgroup problem
CoRR abs/cs/0610086: (2006) |
2005 |
37 | EE | Stephen A. Fenner,
Frederic Green,
Steven Homer,
Yong Zhang:
Bounds on the Power of Constant-Depth Quantum Circuits.
FCT 2005: 44-55 |
36 | EE | Stephen A. Fenner,
Yong Zhang:
Quantum Algorithms for a Set of Group Theoretic Problems.
ICTCS 2005: 215-227 |
35 | EE | Stephen A. Fenner,
Jack H. Lutz,
Elvira Mayordomo,
Patrick Reardon:
Weakly useful sequences.
Inf. Comput. 197(1-2): 41-54 (2005) |
2004 |
34 | EE | Marcus Schaefer,
Stephen A. Fenner:
Simplicity and Strong Reductions
Electronic Colloquium on Computational Complexity (ECCC)(071): (2004) |
2003 |
33 | | Stephen A. Fenner:
A physics-free introduction to the quantum computation model, Computational Complexity Column.
Bulletin of the EATCS 79: 69-85 (2003) |
32 | EE | Stephen A. Fenner:
A Physics-Free Introduction to the Quantum Computation Model
CoRR cs.CC/0304008: (2003) |
31 | EE | Stephen A. Fenner,
Lance Fortnow,
Stuart A. Kurtz,
Lide Li:
An oracle builder's toolkit.
Inf. Comput. 182(2): 95-136 (2003) |
30 | EE | Stephen A. Fenner,
Lance Fortnow,
Ashish V. Naik,
John D. Rogers:
Inverting onto functions.
Inf. Comput. 186(1): 90-103 (2003) |
29 | EE | Stephen A. Fenner:
PP-Lowness and a Simple Definition of AWPP.
Theory Comput. Syst. 36(2): 199-212 (2003) |
2002 |
28 | EE | Stephen A. Fenner:
Gales and supergales are equivalent for defining constructive Hausdorff dimension
CoRR cs.CC/0208044: (2002) |
27 | EE | Stephen A. Fenner:
PP-lowness and a simple definition of AWPP
Electronic Colloquium on Computational Complexity (ECCC)(036): (2002) |
2001 |
26 | EE | Harry Buhrman,
Stephen A. Fenner,
Lance Fortnow,
Leen Torenvliet:
Two oracles that force a big crunch.
Computational Complexity 10(2): 93-116 (2001) |
25 | EE | Stephen A. Fenner,
Steven Homer,
Randall Pruim,
Marcus Schaefer:
Hyper-polynomial hierarchies and the polynomial jump.
Theor. Comput. Sci. 262(1): 241-256 (2001) |
2000 |
24 | EE | Harry Buhrman,
Stephen A. Fenner,
Lance Fortnow,
Dieter van Melkebeek:
Optimal Proof Systems and Sparse Sets.
STACS 2000: 407-418 |
1999 |
23 | EE | Stephen A. Fenner,
Frederic Green,
Steven Homer,
Alan L. Selman,
Thomas Thierauf,
Heribert Vollmer:
Complements of Multivalued Functions.
Chicago J. Theor. Comput. Sci. 1999: (1999) |
22 | EE | 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) 6(3): (1999) |
21 | | Stephen A. Fenner,
Marcus Schaefer:
Bounded Immunity and Btt-Reductions.
Math. Log. Q. 45: 3-21 (1999) |
1997 |
20 | | Harry Buhrman,
Stephen A. Fenner,
Lance Fortnow:
Results on Resource-Bounded Measure.
ICALP 1997: 188-194 |
19 | EE | Stephen A. Fenner,
Steven Homer,
Randall Pruim,
Marcus Schaefer:
Hyper-Polynomial Hierarchies and the NP-Jump.
IEEE Conference on Computational Complexity 1997: 102-110 |
18 | | Stephen A. Fenner,
Steven Homer,
Mitsunori Ogihara,
Alan L. Selman:
Oracles that Compute Values.
SIAM J. Comput. 26(4): 1043-1065 (1997) |
1996 |
17 | EE | Stephen A. Fenner,
Lance Fortnow,
Ashish V. Naik,
John D. Rogers:
Inverting Onto Functions.
IEEE Conference on Computational Complexity 1996: 213-222 |
16 | EE | Stephen A. Fenner,
Frederic Green,
Steven Homer,
Alan L. Selman,
Thomas Thierauf,
Heribert Vollmer:
Complements of Multivalued Functions.
IEEE Conference on Computational Complexity 1996: 260-269 |
15 | | Stephen A. Fenner,
Lance Fortnow,
Lide Li:
Gap-Definability as a Closure Property.
Inf. Comput. 130(1): 1-17 (1996) |
14 | | Stephen A. Fenner,
Lance Fortnow,
Stuart A. Kurtz:
The Isomorphism Conjecture Holds Relative to an Oracle.
SIAM J. Comput. 25(1): 193-206 (1996) |
1995 |
13 | | Stephen A. Fenner,
Jack H. Lutz,
Elvira Mayordomo:
Weakly Useful Sequences.
ICALP 1995: 393-404 |
12 | | Stephen A. Fenner,
Lance Fortnow:
Beyond P^(NP) - NEXP.
STACS 1995: 619-627 |
11 | | Stephen A. Fenner:
Inverting the Turing Jump in Complexity Theory.
Structure in Complexity Theory Conference 1995: 102-110 |
10 | | Stephen A. Fenner:
Resource-Bounded Baire Category: A Stronger Approach.
Structure in Complexity Theory Conference 1995: 182-192 |
1994 |
9 | | Stephen A. Fenner,
Lance Fortnow,
Stuart A. Kurtz:
Gap-Definable Counting Classes.
J. Comput. Syst. Sci. 48(1): 116-148 (1994) |
8 | | Stephen A. Fenner:
Almost Weakly 2-Generic Sets.
J. Symb. Log. 59(3): 868-887 (1994) |
1993 |
7 | | Stephen A. Fenner,
Steven Homer,
Mitsunori Ogiwara,
Alan L. Selman:
On Using Oracles That Compute Values.
STACS 1993: 398-407 |
6 | | Stephen A. Fenner,
Lance Fortnow,
Lide Li:
Gap-Definability as a Closure Property.
STACS 1993: 484-493 |
5 | | Stephen A. Fenner,
Lance Fortnow,
Stuart A. Kurtz,
Lide Li:
An Oarcle Builder's Toolkit.
Structure in Complexity Theory Conference 1993: 120-131 |
1992 |
4 | | Stephen A. Fenner,
Lance Fortnow,
Stuart A. Kurtz:
The Isomorphism Conjecture Holds Relative to an Oracle
FOCS 1992: 30-39 |
1991 |
3 | | Stephen A. Fenner:
Notions of Resource-Bounded Category and Genericity.
Structure in Complexity Theory Conference 1991: 196-212 |
2 | | Stephen A. Fenner,
Lance Fortnow,
Stuart A. Kurtz:
Gap-Definable Counting Classes.
Structure in Complexity Theory Conference 1991: 30-42 |
1989 |
1 | | Stephen A. Fenner,
Stuart A. Kurtz,
James S. Royer:
Every Polynomial-Time 1-Degree Collapses iff P=PSPACE
FOCS 1989: 624-629 |