Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Fenner, Stephen"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the complexity of the hidden subgroup problem
Stephen Fenner
,
Yong Zhang
International Journal of Foundations of Computer Science
24
(8), 2013, pp. 1221-1234
Functions that preserve p-randomness
Stephen A. Fenner
Information and Computation
231
, 2013, pp. 125-142
Monochromatic boxes in colored grids
Joshua Cooper
,
Stephen Fenner
,
Semmy Purewal
SIAM Journal on Discrete Mathematics
25
(3), 2011, pp. 1054-1068
Efficient universal quantum circuits
Debajyoti Bera
,
Stephen Fenner
,
Frederic Green
,
Steve Homer
Lecture Notes in Computer Science
5609
, 2009, pp. 418-428
The complexity of finding SUBSEQ(A)
Stephen Fenner
,
William Gasarch
,
Brian Postow
Theory of Computing Systems
45
(3), 2009, pp. 577-612
Weakly useful sequences
Stephen A. Fenner
,
Jack H. Lutz
,
Elvira Mayordomo
,
Patrick Reardon
Information and Computation
197
(1-2), 2005, pp. 41-54
An oracle builder's toolkit
Stephen Fenner
,
Lance Fortnow
,
Stuart A. Kurtz
,
Lide Li
Information and Computation
182
(2), 2003, pp. 95-136
Inverting onto functions
Stephen A. Fenner
,
Lance Fortnow
,
Ashish V. Naik
,
John D. Rogers
Information and Computation
186
(1), 2003, pp. 90-103
PP
-lowness and a simple definition of
AWPP
Stephen A. Fenner
Theory of Computing Systems
36
(2), 2003, pp. 199-212
Counting complexity and quantum computation
Stephen A. Fenner
Computational Mathematics Series
, 2002, pp. 171-219
Hyper-polynomial hierarchies and the polynomial jump
Stephen Fenner
,
Steven Homer
,
Randall Pruim
,
Marcus Schaefer
Theoretical Computer Science
262
(1-2), 2001, pp. 241-256
Results on resource-bounded measure
Harry Buhrman
,
Stephen Fenner
,
Lance Fortnow
Lecture Notes in Computer Science
1256
, 1997, pp. 188-194
Oracles that compute values
Stephen Fenner
,
Steven Homer
,
Mitsunori Ogihara
,
Alan Selman
SIAM Journal on Computing
26
(4), 1997, pp. 1043-1065
Hyper-polynomial hierarchies and the
NP
-jump
Stephen Fenner
,
Steven Homer
,
Randall Pruim
,
Marcus Schaefer
Proceedings of the 12th Annual IEEE Conference on Computational Complexity (Ulm, Germany, June 24-27, 1997)
, 1997, pp. 102-110a
The isomorphism conjecture holds relative to an oracle
Stephen Fenner
,
Lance Fortnow
,
Stuart A. Kurtz
SIAM Journal on Computing
25
(1), 1996, February, pp. 193-206
Gap-definability as a closure property
Stephen Fenner
,
Lance Fortnow
,
Lide Li
Information and Computation
130
(1), 1996, pp. 1-17
Inverting onto functions
Stephen A. Fenner
,
Lance Fortnow
,
Ashish V. Naik
,
John D. Rogers
Proceedings of the 11th Annual IEEE Conference on Computational Complexity (Philadelphia, Pennsylvania, May 24-27, 1996)
, 1996, pp. 213-223
Complements of multivalued functions
Stephen Fenner
,
Frederic Green
,
Steven Homer
,
Alan L. Selman
,
Thomas Thierauf
,
Heribert Vollmer
Proceedings of the 11th Annual IEEE Conference on Computational Complexity (Philadelphia, Pennsylvania, May 24-27, 1996)
, 1996, pp. 260-269
Beyond
P^{NP} = NEXP
Stephen A. Fenner
,
Lance J. Fortnow
Lecture Notes in Computer Science
900
, 1995, pp. 619-627
Weakly useful sequences
Stephen A. Fenner
,
Jack H. Lutz
,
Elvira Mayordomo
Lecture Notes in Computer Science
944
, 1995, pp. 393-404
Inverting the Turing jump in complexity theory
Stephen A. Fenner
Proceedings of the 10th Annual Conference on Structure in Complexity Theory, CSCT'95 (Minneapolis, Minnesota, June 19-22, 1995)
, 1995, pp. 102-110
Resource-bounded Baire category: A stronger approach
Stephen A. Fenner
Proceedings of the 10th Annual Conference on Structure in Complexity Theory, CSCT'95 (Minneapolis, Minnesota, June 19-22, 1995)
, 1995, pp. 182-192
Inverting the turing jump in complexity theory
Stephen A. Fenner
Proceedings of the Tenth Annual Conference on Structure in Complexity Theory (Minneapolis, Minnesota, June 19-22, 1995)
, 1995, pp. 102-110
Resource-bounded baire category: A stronger approach
Stephen A. Fenner
Proceedings of the Tenth Annual Conference on Structure in Complexity Theory (Minneapolis, Minnesota, June 19-22, 1995)
, 1995, pp. 182-192
Gap-definable counting classes
Stephen A. Fenner
,
Lance J. Fortnow
,
Stuart A. Kurtz
Journal of Computer and System Sciences
48
(1), 1994, pp. 116-148
Seiten 1
2
>