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="Long, T."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
UP
and the low and high hierarchies: A relativized separation
M.-J. Sheu
,
T.J. Long
Math. Systems Theory
29
(5), 1996, pp. 423-449
A refinement of the low and high hierarchies
T.J. Long
,
Ming-Jye Sheu
Math. Systems Theory
28
(4), 1995, pp. 299-327
Honest polynomial degrees and P=?NP
S. Homer
,
T.J. Long
Theoretical Computer Science
51
(3), 1987, pp. 265-280
A note on one-way functions and polynomial time isomorphisms
K. Ko
,
T. Long
,
D. Du
Lecture Notes in Computer Science
223
, 1986, pp. 196
A note on one-way functions and polynomial-time isomorphisms
K.-I. Ko
,
T.J. Long
,
D.-Z. Du
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, STOC'86 (Berkeley, CA, May 28-30, 1986)
, 1986, pp. 295-303
One one-way functions and polynomial-time isomorphisms
Ker-I Ko
,
T.J. Long
,
D.-Z. Du
Theoretical Computer Science
47
(3), 1986, pp. 263-276
Relativizing complexity classes with sparse oracles
T.J. Long
,
A.L. Selman
Journal of the ACM
33
(3), 1986, pp. 618-627
Qualitative relativizations of complexity classes
R.V. Book
,
T.J. Long
,
A.L. Selman
Journal of Computer and System Sciences
30
(3), 1985, June, pp. 395-413
On restricting the size of oracles compared with restricting access to oracles
T.J. Long
SIAM Journal on Computing
14
(3), 1985, August, pp. 585-597
Sparse oracles and uniform complexity classes
J. Balcázar
,
R. Book
,
T. Long
,
U. Schöning
,
A. Selman
Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, FOCS'84 (Singer Island, FL, October 24-26, 1984)
, 1984, pp. 308-311
Quantitative relativizations of complexity classes
R.V. Book
,
T.J. Long
,
A.L. Selman
SIAM Journal on Computing
13
(3), 1984, August, pp. 461-487
A note on deterministic and nondeterministic time complexity
S. Even
,
T.J. Long
,
Y. Yacobi
Information and Control
55
(1-3), 1982, pp. 117-124
A note on sparse oracles for NP
T.J. Long
Journal of Computer and System Sciences
24
(2), 1982, April, pp. 224-232
Strong nondeterministic polynomial-time reducibilities
T.J. Long
Theoretical Computer Science
21
(1), 1982, pp. 1-25
On
\Gamma
-reducibility versus polynomial time many-one reducibility
T.J. Long
Theoretical Computer Science
14
, 1981, pp. 91-101
On
\Gamma
-reducibility versus polynomial time many-one reducibility
T.J. Long
Proceedings of the 11th Annual ACM Symposium on Theory of Computing, STOC'79 (Atlanta, GA, April 30 - May 2, 1979)
, 1979, pp. 278-287