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="Mahaney, S.R."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The isomorphism conjecture fails relative to a random oracle
S.A. Kurtz
,
S.R. Mahaney
,
J.S. Royer
Proceedings of the 4th Annual Conference on Structure in Complexity Theory, CSCT'89 (University of Oregon, Eugene, Oregon, June 19-22, 1989)
, 1989, pp. 2
Progress on collapsing degrees
S.A. Kurtz
,
S.R. Mahaney
,
J.S. Royer
Proceedings of the 2nd Annual Conference on Structure in Complexity Theory, CSCT'87 (Cornell University, Ithaca, NY, June 16-19, 1987)
, 1987, pp. 126-131
Polygon containment under translation
B.S. Baker
,
S.J. Fortune
,
S.R. Mahaney
Journal of Algorithms
7
(4), 1986, December, pp. 532-548
Collapsing degrees
S.A. Kurtz
,
S.R. Mahaney
,
J.S. Royer
Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science, FOCS'86 (Toronto, Canada, October 27-29, 1986)
, 1986, pp. 380-389
Sparse complete sets of
NP
: solution of a conjecture of Berman and Hartmanis
S.R. Mahaney
Journal of Computer and System Sciences
25
(2), 1982, October, pp. 130-143
On the number of
P
-isomorphism classes of
NP
-complete sets
S.R. Mahaney
Proceedings of the 22nd Annual IEEE Symposium on Foundations of Computer Science, FOCS'81 (Nashville, TN, October 28-30, 1981)
, 1981, pp. 271-278
An essay about research on sparse
NP
complete sets
J. Hartmanis
,
S.R. Mahaney
Lecture Notes in Computer Science
88
, 1980, pp. 40-57
Sparse complete sets for
NP
: Solution of a conjecture of Berman and Hartmanis
S.R. Mahaney
Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science, FOCS'80 (Syracuse, NY, October 13-15, 1980)
, 1980, pp. 54-60