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
[1]
Hilfe
Suche: Author="Huynh, D."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The complexity of ranking
D.T. Huynh
Proceedings of the 3rd Annual Conference on Structure in Complexity Theory, CSCT'88 (Georgetown University, Washington D.C., June 14-17 1988)
, 1988, pp. 204-212
A hierarchy theorem for almost everywhere complex sets with application to polynomial complexity degrees
J.G. Geske
,
D.T. Huynh
,
A.L. Selman
Lecture Notes in Computer Science
247
, 1987, pp. 125-135
On the complexity of containment, equivalence and reachibility for finite and 2-dimensional vector addition systems with states
R.R. Howell
,
D.T. Huynh
,
L.E. Rosier
,
H.C. Yen
Lecture Notes in Computer Science
247
, 1987, pp. 360-370
On solving hard problems by polynomial-size circuits
D.T. Huynh
Information Processing Letters
24
(3), 1987, February, pp. 171-176
Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states
R. Howell
,
D. Huynh
,
L. Rosier
,
H.-C. Yen
Technical Report (TR-86-08), 1986, March
Resource-bounded Kolmogorov complexity of hard languages
D. Huynh
Lecture Notes in Computer Science
223
, 1986, pp. 184-195
A superexponential lower bound for Gröbner bases and Church-Rosser commutative Thue systems
D.T. Huynh
Information and Control
68
(1-3), 1986, pp. 196-206
Some observations about the randomness of hard problems
D.T. Huynh
SIAM Journal on Computing
15
(4), 1986, November, pp. 1101-1105
The complexity of the membership problem for two subclasses of polynomial ideals
D.T. Huynh
SIAM Journal on Computing
15
(2), 1986, May, pp. 581-594
The complexity of the equivalence problem for commutative semigroups and symmetric vector addition systems
D.T. Huynh
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, STOC'85 (Providence, RI, May 6-8, 1985)
, 1985, pp. 405-412
Complexity of the word problem for commutative semigroups of fixed dimension
D.T. Huynh
Acta Informatica
22
(4), 1985, pp. 421-432
The complexity of equivalence problems for commutative grammars
D.T. Huynh
Information and Control
66
(1/2), 1985, pp. 103-121