On polynomial-time Turing and many—one completeness in PSPACE
Authors:
Osamu Watanabe;Shouwen Tang
Affiliations:
-;-
Venue:
Theoretical Computer Science
Year:
1992
Citing
0
Cited
1
SIGACT news complexity theory column 40
ACM SIGACT News
Quantified Score
Hi-index
5.23
Visualization
Abstract