Seguir
Stephen Fenner
Stephen Fenner
Professor of Computer Science and Engineering, University of South Carolina
E-mail confirmado em cec.sc.edu - Página inicial
Título
Citado por
Citado por
Ano
Gap-definable counting classes
SA Fenner, LJ Fortnow, SA Kurtz
Journal of Computer and System Sciences 48 (1), 116-148, 1994
3131994
Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy
S Fenner, F Green, S Homer, R Pruim
Proceedings of the Royal Society of London. Series A: Mathematical, Physical …, 1999
113*1999
Bipartite perfect matching is in quasi-NC
S Fenner, R Gurjar, T Thierauf
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
1082016
An oracle builder’s toolkit
S Fenner, L Fortnow, SA Kurtz, L Li
Information and Computation 182 (2), 95-136, 2003
1082003
Inverting onto functions
SA Fenner, L Fortnow, AV Naik, JD Rogers
Information and Computation 186 (1), 90-103, 2003
672003
Quantum lower bounds for fanout
M Fang, S Fenner, F Green, S Homer, Y Zhang
arXiv preprint quant-ph/0312208, 2003
422003
Bounds on the power of constant-depth quantum circuits
S Fenner, F Green, S Homer, Y Zhang
International Symposium on Fundamentals of Computation Theory, 44-55, 2005
392005
The isomorphism conjecture holds relative to an oracle
S Fenner, L Fortnow, SA Kurtz
SIAM Journal on Computing 25 (1), 193-206, 1996
391996
PP-lowness and a simple definition of AWPP
SA Fenner
Theory of Computing Systems 36, 199-212, 2003
372003
Rectangle free coloring of grids
S Fenner, W Gasarch, C Glover, S Purewal
arXiv preprint arXiv:1005.3750, 2010
362010
Notions of Resource-Bounded Category and Genericity.
SA Fenner
SCT, 196-212, 1991
361991
On using oracles that compute values
S Fenner, S Homer, M Ogiwara, AL Selman
STACS 93: 10th Annual Symposium on Theoretical Ascpects of Computer Science …, 1993
331993
Oracles that compute values
S Fenner, S Homer, M Ogihara, A Selman
SIAM Journal on Computing 26 (4), 1043-1065, 1997
321997
Efficient universal quantum circuits
D Bera, S Fenner, F Green, S Homer
Quantum Information & Computation 10 (1), 16-28, 2010
232010
Combinatorial game complexity: an introduction with poset games
SA Fenner, J Rogers
arXiv preprint arXiv:1505.07416, 2015
222015
Gales and supergales are equivalent for defining constructive Hausdorff dimension
SA Fenner
arXiv preprint cs/0208044, 2002
212002
Resource-bounded Baire category: a stronger approach
SA Fenner
Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference …, 1995
211995
Complements of multivalued functions
S Fenner, F Green, S Homer, AL Selman, T Thierauf, H Vollmer
Proceedings of Computational Complexity (Formerly Structure in Complexity …, 1996
191996
Quantum algorithms for a set of group theoretic problems
SA Fenner, Y Zhang
Italian Conference on Theoretical Computer Science, 215-227, 2005
162005
Universal quantum computation with two-and three-qubit projective measurements
SA Fenner, Y Zhang
arXiv preprint quant-ph/0111077, 2001
152001
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–20