Entry Hunt:1983:CMR from tcs1980.bib
Last update: Thu Sep 27 02:46:46 MDT 2018
Top |
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{Hunt:1983:CMR,
author = "H. B. Hunt and D. J. Rosenkrantz",
title = "The complexity of monadic recursion schemes:
executability problems, nesting depth, and
applications",
journal = j-THEOR-COMP-SCI,
volume = "27",
number = "1--2",
pages = "3--38",
month = nov,
year = "1983",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1980.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Dept. of Computer Sci., State Univ. of New York,
Albany, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computability and decidability; computational
complexity; decision problems; divergence;
executability problems; isomorphism; lower bounds;
monadic recursion schemes complexity; nesting depth;
polynomial bounds; strong equivalence; upper bounds;
weak equivalence",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- application,
13(3)271,
14(2)155,
18(1)41,
18(2)115,
18(2)207,
19(2)189,
23(1)49,
31(1)31,
32(1)121,
34(1)3
- bound,
10(1)1,
10(1)53,
10(1)83,
11(3)321,
12(3)339,
14(1)19,
14(1)103,
14(3)337,
15(3)311,
16(3)307,
19(1)39,
22(3)233,
22(3)285,
23(1)95,
23(2)171,
23(2)211,
24(3)239,
25(1)1,
26(1)25,
27(3)241,
28(3)263,
28(3)337,
29(1)75,
29(1)123,
30(3)319,
32(1)173
- computability,
10(2)133,
11(3)331,
12(3)291,
15(3)329,
16(1)5,
17(2)163,
17(2)193,
18(1)69,
18(3)279,
19(1)17,
19(1)29,
19(2)219,
19(3)231,
19(3)331,
21(2)119,
23(1)37,
23(1)49,
23(3)231,
23(3)333,
23(3)339,
24(3)301,
24(3)313,
25(2)171,
26(1)131,
26(1)233,
27(1)39,
28(1)13,
31(1)101,
31(1)165,
32(1)173
- computational,
10(1)1,
10(1)53,
10(1)83,
10(2)171,
10(3)221,
11(1)1,
11(1)71,
11(1)93,
11(3)321,
12(1)97,
12(2)119,
12(2)161,
12(3)255,
12(3)291,
13(3)271,
13(3)295,
14(1)1,
14(1)91,
14(3)227,
14(3)247,
14(3)289,
14(3)337,
15(1)77,
15(2)181,
15(2)201,
15(3)291,
15(3)321,
16(1)25,
16(1)99,
16(2)115,
16(3)279,
17(1)55,
17(2)213,
17(3)303,
18(1)95,
18(1)105,
18(3)259,
19(1)1,
19(1)17,
19(1)39,
19(2)161,
19(2)203,
19(3)337,
20(3)323,
21(1)1,
21(1)105,
21(2)179,
21(3)255,
22(1)19,
22(1)195,
22(3)285,
22(3)317,
23(2)171,
23(2)187,
23(3)333,
24(2)123,
24(3)221,
24(3)239,
24(3)279,
24(3)291,
25(2)95,
25(2)193,
26(1)197,
26(3)287,
26(3)327,
27(3)241,
28(1)111,
28(1)135,
28(3)277,
29(1)123,
30(3)241,
30(3)319,
31(1)41,
31(1)101,
31(1)125,
31(1)175,
32(1)61,
32(1)77,
32(1)157,
32(1)173,
32(1)221,
32(3)227,
32(3)279,
33(1)117,
33(2)261,
33(2)305,
34(1)17,
34(1)83,
34(1)207,
34(3)337
- decidability,
10(2)133,
11(3)331,
12(3)291,
15(3)329,
16(1)5,
17(1)99,
17(2)163,
17(2)193,
18(1)69,
18(3)279,
19(1)17,
19(1)29,
19(2)219,
19(3)231,
19(3)331,
21(2)119,
23(1)37,
23(1)49,
23(3)231,
23(3)333,
23(3)339,
24(3)301,
24(3)313,
25(2)171,
26(1)131,
26(1)233,
27(1)39,
29(1)185,
31(1)165,
32(3)261,
32(3)297,
33(2)261,
34(3)255
- decision,
11(1)71,
11(2)123,
17(2)213,
19(3)321,
23(1)49,
23(3)333,
24(3)301,
24(3)313,
26(1)83,
27(3)333,
29(1)185,
31(1)1,
32(1)173,
32(3)279,
32(3)297,
33(2)305
- depth,
13(2)137,
18(1)105,
23(2)155,
32(1)157,
32(1)215
- divergence,
14(3)247
- equivalence,
12(3)339,
13(3)239,
13(3)295,
14(2)155,
15(1)1,
15(1)51,
15(2)159,
17(1)55,
17(1)99,
17(2)113,
17(2)163,
17(3)235,
18(3)279,
19(1)17,
19(1)29,
19(3)267,
21(2)231,
22(1)135,
23(2)129,
23(3)231,
24(3)313,
25(2)171,
29(3)251,
29(3)285,
31(1)49,
31(1)73,
31(1)139,
31(3)297,
32(1)87,
32(1)121,
32(1)185,
32(3)261,
33(1)3,
33(2)239,
33(2)305,
34(1)83,
34(3)255
- isomorphism,
17(1)75,
17(1)91,
21(1)91,
31(3)263,
34(1)33
- lower,
10(1)1,
10(1)83,
11(3)321,
19(1)39,
22(3)233,
22(3)285,
29(1)75,
29(1)123,
30(3)319,
34(3)275
- monadic,
11(2)123,
18(3)325,
19(3)231,
25(2)171,
33(2)261
- nesting,
31(1)1
- polynomial,
10(1)1,
10(1)53,
10(2)111,
11(1)93,
11(3)321,
11(3)331,
11(3)337,
12(1)1,
12(2)161,
12(3)303,
13(3)271,
14(1)91,
14(3)289,
15(1)27,
15(1)77,
15(3)251,
15(3)279,
15(3)329,
16(2)223,
17(1)91,
17(2)163,
18(1)95,
19(1)17,
19(3)287,
21(1)99,
21(1)105,
21(2)179,
21(3)255,
22(1)195,
22(3)285,
22(3)317,
23(1)95,
24(3)291,
25(1)67,
26(1)25,
27(1)127,
28(1)135,
31(1)101,
31(1)125,
31(3)227,
32(1)61,
32(3)279,
34(1)17,
34(1)207
- recursion,
15(2)159,
22(1)135,
26(1)53,
34(1)33,
34(1)135
- schemes,
17(2)163,
17(2)217,
17(3)235,
19(3)337,
20(2)95,
21(3)281,
23(1)83,
27(1)225,
28(1)151,
30(3)241,
33(1)95,
33(2)195
- strong,
21(1)1,
24(1)21
- upper,
16(1)93,
22(3)285,
24(3)239,
27(3)241,
28(3)263,
29(1)123,
30(3)319,
32(1)173
- weak,
18(3)259,
23(2)107,
24(1)21,
33(1)13