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="Rogers, John"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Does the polynomial hierarchy collapse if onto functions are invertible?
Harry Buhrman
,
Lance Fortnow
,
Michal Koucký
,
John D. Rogers
,
Nikolay Vershchagin
Theory of Computing Systems
46
(1), 2010, pp. 143-156
Inverting onto functions
Stephen A. Fenner
,
Lance Fortnow
,
Ashish V. Naik
,
John D. Rogers
Information and Computation
186
(1), 2003, pp. 90-103
Complexity limitations on quantum computation
Lance Fortnow
,
John Rogers
Journal of Computer and System Sciences
59
(2), 1999, pp. 240-252
Complexity limitations on quantum computation
Lance Fortnow
,
John Rogers
Proceedings of the 13th Annual IEEE Conference on Computational Complexity (Buffalo, New York, June 15-18, 1998)
, 1998, pp. 202-209
A hierarchy based on output multiplicity
Ashish V. Naik
,
John D. Rogers
,
James S. Royer
,
Alan L. Selman
Theoretical Computer Science
207
(1), 1998, pp. 131-157
The isomorphism conjecture holds and one-way functions exist relative to an oracle
John Rogers
Journal of Computer and System Sciences
54
(3), 1997, pp. 412-423
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
The isomorphism conjecture holds and one-way functions exist relative to an oracle
John Rogers
Proceedings of the Tenth Annual Conference on Structure in Complexity Theory (Minneapolis, Minnesota, June 19-22, 1995)
, 1995, pp. 90-101
Separability and one-way functions
Lance Fortnow
,
John Rogers
Lecture Notes in Computer Science
834
, 1994, pp. 396-404