Shouwen Tang

According to our database, Shouwen Tang authored at least 12 papers between 1988 and 1996.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

1996

Fast Algorithms for Minimum Matrix Norm with Application in Computer Graphics.

Shouwen Tang, Kaizhong Zhang, Xiaolin Wu

Algorithmica, 1996

1995

Spectral and spatial decorrelation of Landsat-TM data for lossless compression.

Jinfei Wang, Kaizhong Zhang, Shouwen Tang

IEEE Trans. Geosci. Remote. Sens., 1995

1994

Matching with Matrix Norm Minimization.

Shouwen Tang, Kaizhong Zhang, Xiaolin Wu

Proceedings of the Combinatorial Pattern Matching, 5th Annual Symposium, 1994

1993

Exponential-Time and Subexponential-Time Sets.

Shouwen Tang, Bin Fu, Tian Liu

Theor. Comput. Sci., 1993

1992

On Polynomial-Time Turing and Many-One Completeness in PSPACE.

Osamu Watanabe, Shouwen Tang

Theor. Comput. Sci., 1992

1991

Polynomial-Time Reducibilities and "Almost All" Oracle Sets.

Shouwen Tang, Ronald V. Book

Theor. Comput. Sci., 1991

Reducibilities on tally and sparse sets.

Shouwen Tang, Ronald V. Book

RAIRO Theor. Informatics Appl., 1991

1990

Characterizing Polynomial Complexity Classes by Reducibilities.

Ronald V. Book, Shouwen Tang

Math. Syst. Theory, 1990

Additional Queries to Random and Pseudorandom Oracles.

Ronald V. Book, Jack H. Lutz, Shouwen Tang

Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

1989

On Tally Relativizations of BP-Complexity Classes.

Shouwen Tang, Osamu Watanabe

SIAM J. Comput., 1989

A Note on Sparse Sets and the Polynomial-Time Hierarchy.

Ronald V. Book, Shouwen Tang

Inf. Process. Lett., 1989

1988

Separating Polynomial-Time Turing and Truth-Table Reductions by Tally Sets.

Shouwen Tang, Ronald V. Book

Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988