Entry Watanabe:1992:PTT from tcs1990.bib
Last update: Wed Sep 26 02:11:46 MDT 2018
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Watanabe:1992:PTT,
author = "O. Watanabe and Shouwen Tang",
title = "On polynomial-time {Turing} and many-one completeness
in {PSPACE}",
journal = j-THEOR-COMP-SCI,
volume = "97",
number = "2",
pages = "199--215",
day = "27",
month = apr,
year = "1992",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:24:22 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C4220 (Automata theory); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Comput. Sci., Tokyo Inst. of Technol.,
Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; dense set; deterministic;
many-one completeness; polynomial-time computation;
polynomial-time Turing; PSPACE-complete sets;
randomized completeness; sparse sets; Turing machines",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- complete, PSPACE-,
80(1)77,
84(1)127,
88(1)99,
110(1)197,
110(1)215,
112(2)371,
123(2)329,
131(2)243,
134(1)225,
123(2)329
- completeness,
70(1)99,
70(2)193,
71(1)155,
72(1)55,
72(2)133,
73(2)155,
73(2)177,
74(1)37,
74(2)227,
75(1)85,
75(1)111,
77(1)73,
79(2)295,
79(2)341,
80(2)303,
81(2)223,
83(1)71,
86(1)35,
86(1)81,
86(1)z,
87(1)203,
89(2)207,
91(2)181,
93(2)321,
94(1)101,
95(1)75,
95(1)97,
97(1)143,
104(1)3,
105(2)167,
105(2)217,
109(1)7,
111(1)125,
114(2)231,
118(2)193,
119(1)127,
120(1)83,
122(1)97,
128(1)127,
129(1)143,
129(1)167,
130(2)239,
135(1)11,
135(2)405
- dense,
111(1)191,
120(2)279
- many-one,
75(3)357,
81(2)189,
115(2)371,
132(1)229
- one, many-,
75(3)357,
81(2)189,
115(2)371,
132(1)229
- polynomial-time,
73(3)249,
77(3)221,
81(1)35,
81(2)169,
84(2)199,
85(1)75,
85(2)305,
88(1)1,
88(1)33,
95(2)263,
97(1)1,
97(2)263,
100(1)157,
100(1)205,
101(2)161,
102(1)185,
102(2)215,
103(1)3,
107(1)3,
110(1)215,
113(1)167,
115(2)383,
119(1)187,
119(1)z,
123(2)273,
129(1)95,
132(1)179,
134(2)473
- PSPACE,
93(2)265,
100(1)1,
100(1)45,
123(2)183,
126(2)183,
132(1)319
- PSPACE-complete,
80(1)77,
84(1)127,
88(1)99,
110(1)197,
110(1)215,
112(2)371,
123(2)329,
131(2)243,
134(1)225
- randomized,
81(2)237,
83(2)275,
99(1)157,
100(1)157,
107(1)63,
107(1)135,
112(2)339,
130(1)17,
130(1)73,
130(1)85,
130(1)101,
130(1)163
- sparse,
82(1)51,
84(2)151,
86(2)325,
88(1)1,
92(1)165,
93(2)265,
99(2)279,
112(2)255,
134(2)263
- Tang, Shouwen,
81(1)35,
115(2)371
- time, polynomial-,
73(3)249,
77(3)221,
81(1)35,
81(2)169,
84(2)199,
85(1)75,
85(2)305,
88(1)1,
88(1)33,
95(2)263,
97(1)1,
97(2)263,
100(1)157,
100(1)205,
101(2)161,
102(1)185,
102(2)215,
103(1)3,
107(1)3,
110(1)215,
113(1)167,
115(2)383,
119(1)187,
119(1)z,
123(2)273,
129(1)95,
132(1)179,
134(2)473
- Watanabe, O.,
83(2)337,
100(1)205