 | 1996 |
|---|
| 13 |       | Shouwen Tang,
Kaizhong Zhang,
Xiaolin Wu:
Fast Algorithms for Minimum Matrix Norm with Application in Computer Graphics.
Algorithmica 15(1): 68-81 (1996) |
| 1994 |
|---|
| 12 | | Shouwen Tang,
Kaizhong Zhang,
Xiaolin Wu:
Matching with Matrix Norm Minimization.
CPM 1994: 250-258 |
| 1993 |
|---|
| 11 | | Shouwen Tang,
Bin Fu,
Tran Liu:
Exponential-Time and Subexponential-Time Sets.
Theor. Comput. Sci. 115(2): 371-381 (1993) |
| 1992 |
|---|
| 10 | | Osamu Watanabe,
Shouwen Tang:
On Polynomial-Time Turing and Many-One Completeness in PSPACE.
Theor. Comput. Sci. 97(2): 199-215 (1992) |
| 1991 |
|---|
| 9 | | Shouwen Tang,
Bin Fu,
Tian Liu:
Exponential Time and Subexponential Time Sets.
Structure in Complexity Theory Conference 1991: 230-237 |
| 8 | | Shouwen Tang,
Ronald V. Book:
Reducibilities on tally and sparse sets.
ITA 25: 293-304 (1991) |
| 7 | | Shouwen Tang,
Ronald V. Book:
Polynomial-Time Reducibilities and ``Almost All'' Oracle Sets.
Theor. Comput. Sci. 81(1): 35-47 (1991) |
| 1990 |
|---|
| 6 |  | Ronald V. Book,
Jack H. Lutz,
Shouwen Tang:
Additional Queries to Random and Pseudorandom Oracles.
ICALP 1990: 283-293 |
| 5 | | Ronald V. Book,
Shouwen Tang:
Characterizing Polynomial Complexity Classes by Reducibilities.
Mathematical Systems Theory 23(3): 165-174 (1990) |
| 1989 |
|---|
| 4 | | Osamu Watanabe,
Shouwen Tang:
On Polynomial Time Turing and Many-One Completeness in PSPACE.
Structure in Complexity Theory Conference 1989: 15-23 |
| 3 | | Ronald V. Book,
Shouwen Tang:
A Note on Sparse Sets and the Polynomial-Time Hierarchy.
Inf. Process. Lett. 33(3): 141-143 (1989) |
| 2 | | Shouwen Tang,
Osamu Watanabe:
On Tally Relativizations of BP-Complexity Classes.
SIAM J. Comput. 18(3): 449-462 (1989) |
| 1988 |
|---|
| 1 | | Shouwen Tang,
Ronald V. Book:
Separating Polynomial-Time Turing and Truth-Table Reductions by Tally Sets.
ICALP 1988: 591-599 |
