Entry Hemachandra:1991:SPE 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{Hemachandra:1991:SPE,
author = "L. A. Hemachandra and A. Hoene and D. Siefkes and P.
Young",
title = "On sets polynomially enumerable by iteration",
journal = j-THEOR-COMP-SCI,
volume = "80",
number = "2",
pages = "203--225",
day = "29",
month = mar,
year = "1991",
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 = "C1160 (Combinatorial mathematics); C4220 (Automata
theory); C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Rochester Univ., NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "complex sets; computability; computational complexity;
exponential-time complete sets; NP-complete sets;
polynomial time hierarchy; polynomially enumerable by
iteration; set theory; Turing machine; Turing
machines",
pubcountry = "Netherlands",
treatment = "B Bibliography; T Theoretical or Mathematical",
}
Related entries
- complete,
70(1)127,
70(2)233,
71(3)347,
72(2)265,
74(1)3,
75(1)85,
75(1)z,
75(3)357,
76(2)179,
81(1)1,
83(2)337,
85(1)75,
87(1)1,
88(1)33,
88(1)83,
89(2)207,
91(1)101,
94(2)281,
96(2)305,
97(2)183,
98(1)27,
98(1)z,
100(2)365,
102(1)135,
104(2)263,
111(1)125,
111(1)z,
112(2)255,
114(1)63,
114(2)231,
118(2)167,
118(2)315,
119(1)127,
119(1)z,
120(1)83,
121(1)351,
122(1)97,
124(1)1,
129(2)309,
130(1)203,
131(1)95,
131(2)311,
132(1)229,
133(2)205,
134(1)27,
136(2)487,
136(2)507
- complete, NP-,
81(1)49,
81(1)65,
81(1)155,
81(2)257,
84(1)23,
84(2)179,
85(1)205,
92(1)145,
99(1)157,
104(2)185,
104(2)285,
108(2)365,
119(2)293,
120(2)311,
129(1)95,
129(2)309,
131(2)361,
131(2)449,
131(2)463,
132(1)229,
133(1)85,
133(1)95,
133(2)421,
134(1)209,
134(2)263,
134(2)287,
134(2)387,
135(1)155,
135(2)361,
120(2)311,
135(1)155
- complex,
76(1)53,
79(1)37,
116(2)373
- computability,
73(3)313,
77(3)221,
82(1)1,
86(2)377,
94(1)101,
97(1)1,
100(2)267,
113(2)191,
116(2)317,
119(1)187,
119(1)z,
121(1)89,
131(2)243,
132(1)113,
133(1)65,
134(2)537
- enumerable,
76(2)323,
81(2)305,
93(2)327,
124(1)149
- exponential-time,
81(1)137,
99(2)301,
113(1)55,
115(2)371,
129(2)309,
134(2)287
- Hemachandra, L. A.,
74(2)217,
83(2)313,
92(2)309
- hierarchy,
73(3)313,
81(1)77,
83(1)97,
83(2)313,
83(2)323,
84(2)199,
85(2)305,
88(2)297,
91(1)71,
95(1)97,
96(2)325,
96(2)345,
97(2)183,
98(2)249,
98(2)289,
100(1)45,
101(2)289,
102(2)215,
104(2)235,
106(2)283,
112(2)339,
112(2)413,
113(1)167,
115(2)225,
115(2)261,
116(1)33,
119(2)293,
120(2)293,
123(2)239,
125(2)355,
127(1)123,
129(2)323,
132(1)1,
134(2)263,
134(2)287
- iteration,
70(1)3,
81(2)269,
83(2)249,
87(2)315,
88(2)313,
100(2)325,
111(1)145,
123(1)95,
123(1)139,
135(2)171
- NP-complete,
81(1)49,
81(1)65,
81(1)155,
81(2)257,
84(1)23,
84(2)179,
85(1)205,
92(1)145,
99(1)157,
104(2)185,
104(2)285,
108(2)365,
119(2)293,
120(2)311,
129(1)95,
129(2)309,
131(2)361,
131(2)449,
131(2)463,
132(1)229,
133(1)85,
133(1)95,
133(2)421,
134(1)209,
134(2)263,
134(2)287,
134(2)387,
135(1)155,
135(2)361
- polynomially,
70(2)261,
81(2)317,
116(2)405,
131(2)331
- time, exponential-,
81(1)137,
99(2)301,
113(1)55,
115(2)371,
129(2)309,
134(2)287