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="Tang, Shouwen"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fast algorithms for minimum matrix norm with application in computer graphics
Shouwen Tang
,
Kaizhong Zhang
,
Xiaolin Wu
Algorithmica
15
(1), 1996, pp. 68-81
Matching with matrix norm minimization
Shouwen Tang
,
Kaizhong Zhang
,
Xiaolin Wu
Lecture Notes in Computer Science
807
, 1994, pp. 250-258
Exponential-time and subexponential-time sets
Shouwen Tang
,
Bin Fu
,
Tian Liu
Theoretical Computer Science
115
(2), 1993, pp. 371-381
On polynomial-time Turing and many-one completeness in PSPACE
Osamu Watanabe
,
Shouwen Tang
Theoretical Computer Science
97
, 1992, pp. 199-215
Polynomial-time reducibilities and ``almost all'' oracle sets
Shouwen Tang
,
Ronald V. Book
Theoretical Computer Science
81
, 1991, pp. 35-47
Exponential time and subexponential time sets
Shouwen Tang
,
Bin Fu
,
Tian Liu
Proceedings of the 6th Annual Conference on Structure in Complexity Theory, CSCT'91 (Chicago, Illinois, June 30-July 3, 1991)
, 1991, pp. 230-237
Additional queries to random and pseudorandom oracles
Ronald V. Book
,
Jack H. Lutz
,
Shouwen Tang
Lecture Notes in Computer Science
443
, 1990, pp. 283-293
Characterizing polynomial complexity classes by reducibilities
Ronald V. Book
,
Shouwen Tang
Math. Systems Theory
23
, 1990, pp. 165-174
A note on sparse sets and the polynomial-time hierarchy
Ronald V. Book
,
Shouwen Tang
Information Processing Letters
33
, 1989/90, pp. 141-143
On tally relativizations of
BP
-complexity classes
Shouwen Tang
,
Osamu Watanabe
SIAM Journal on Computing
18
, 1989, pp. 449-462