The SCEAS System
| |||||||

## Search the dblp DataBase
Shouwen Tang:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Osamu Watanabe, Shouwen Tang
**On Polynomial Time Turing and Many-One Completeness in PSPACE.**[Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1989, pp:15-23 [Conf] - Shouwen Tang, Bin Fu, Tian Liu
**Exponential Time and Subexponential Time Sets.**[Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1991, pp:230-237 [Conf] - Shouwen Tang, Kaizhong Zhang, Xiaolin Wu
**Matching with Matrix Norm Minimization.**[Citation Graph (0, 0)][DBLP] CPM, 1994, pp:250-258 [Conf] - Ronald V. Book, Jack H. Lutz, Shouwen Tang
**Additional Queries to Random and Pseudorandom Oracles.**[Citation Graph (0, 0)][DBLP] ICALP, 1990, pp:283-293 [Conf] - Shouwen Tang, Ronald V. Book
**Separating Polynomial-Time Turing and Truth-Table Reductions by Tally Sets.**[Citation Graph (0, 0)][DBLP] ICALP, 1988, pp:591-599 [Conf] - Shouwen Tang, Kaizhong Zhang, Xiaolin Wu
**Fast Algorithms for Minimum Matrix Norm with Application in Computer Graphics.**[Citation Graph (0, 0)][DBLP] Algorithmica, 1996, v:15, n:1, pp:68-81 [Journal] - Ronald V. Book, Shouwen Tang
**A Note on Sparse Sets and the Polynomial-Time Hierarchy.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1989, v:33, n:3, pp:141-143 [Journal] - Shouwen Tang, Ronald V. Book
**Reducibilities on tally and sparse sets.**[Citation Graph (0, 0)][DBLP] ITA, 1991, v:25, n:, pp:293-304 [Journal] - Ronald V. Book, Shouwen Tang
**Characterizing Polynomial Complexity Classes by Reducibilities.**[Citation Graph (0, 0)][DBLP] Mathematical Systems Theory, 1990, v:23, n:3, pp:165-174 [Journal] - Shouwen Tang, Osamu Watanabe
**On Tally Relativizations of BP-Complexity Classes.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1989, v:18, n:3, pp:449-462 [Journal] - Shouwen Tang, Ronald V. Book
**Polynomial-Time Reducibilities and ``Almost All'' Oracle Sets.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1991, v:81, n:1, pp:35-47 [Journal] - Shouwen Tang, Bin Fu, Tran Liu
**Exponential-Time and Subexponential-Time Sets.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1993, v:115, n:2, pp:371-381 [Journal] - Osamu Watanabe, Shouwen Tang
**On Polynomial-Time Turing and Many-One Completeness in PSPACE.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1992, v:97, n:2, pp:199-215 [Journal]
Search in 0.003secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |