Entry Iliopoulos:1988:CCA from tcs1985.bib
Last update: Thu Sep 27 02:46:57 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{Iliopoulos:1988:CCA,
author = "C. S. Iliopoulos",
title = "On the computational complexity of the {Abelian}
permutation group structure, membership and
intersection problems",
journal = j-THEOR-COMP-SCI,
volume = "56",
number = "2",
pages = "211--222",
month = feb,
year = "1988",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Comput. Sci., Purdue Univ., West Lafayette,
IN, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "abelian permutation group structure; complete
structure; computational complexity; intersection
problems; membership; membership-inclusion testing;
upper bounds; worst-case time complexity",
pubcountry = "Netherlands A03",
treatment = "T Theoretical or Mathematical",
}
Related entries
- abelian,
35(2)179,
41(1)81,
44(2)199,
48(1)127,
54(2)165,
58(1)201
- bound,
36(1)59,
36(2)231,
38(1)69,
38(1)133,
40(2)319,
41(2)247,
41(2)331,
43(2)201,
44(3)247,
45(1)63,
46(2)107,
46(2)329,
47(2)111,
47(2)149,
47(3)323,
49(2)171,
49(2)217,
52(3)239,
52(3)251,
54(2)325,
57(1)97,
57(1)113,
58(1)175,
58(1)263,
60(3)285,
61(2)149,
61(2)299,
62(3)311,
63(2)203,
64(1)1,
64(1)15,
64(1)83,
64(1)125,
64(3)331,
66(1)1,
66(1)105,
66(2)137,
67(1)55,
67(1)115,
69(3)319
- case, worst-,
58(1)325,
62(3)251,
66(1)105
- complete,
35(2)245,
37(1)1,
38(1)55,
38(2)157,
38(2)249,
40(2)85,
41(2)141,
42(2)123,
43(2)189,
44(2)199,
44(3)275,
45(1)1,
46(2)319,
47(1)1,
47(1)27,
47(2)169,
52(3)177,
54(2)199,
57(2)317,
58(1)129,
63(1)43,
63(3)239,
64(1)125,
65(3)343,
67(2)203,
67(2)303,
68(1)37,
68(3)267
- group,
36(2)265,
37(1)51,
41(1)81,
41(1)121,
44(2)199,
44(3)333,
47(1)99,
47(2)191,
48(1)127,
48(2)183,
48(2)329,
51(3)331,
52(1)59,
54(2)165,
56(3)253,
63(3)333,
65(2)249,
66(1)55,
66(2)117,
67(1)55,
67(2)143,
68(3)347,
69(3)319
- Iliopoulos, C. S.,
41(1)81
- intersection,
35(2)261,
38(1)55,
45(2)121,
49(2)267,
49(2)z,
58(1)69,
58(1)129,
59(1)181,
66(2)157
- membership,
36(2)173,
37(2)217,
41(1)81,
45(1)87,
47(1)39,
52(3)177,
54(1)103,
64(2)203
- permutation,
36(2)265,
38(1)83,
41(2)247,
54(2)181,
64(2)135,
64(2)191,
65(2)221
- structure,
35(2)329,
36(2)145,
37(3)269,
38(1)83,
38(2)143,
40(2)175,
40(2)195,
40(2)257,
40(2)275,
40(2)301,
41(1)81,
41(1)95,
42(1)1,
42(2)123,
43(2)169,
44(2)175,
45(3)293,
46(2)197,
48(1)75,
48(2)273,
49(2)239,
50(2)103,
50(2)137,
51(1)129,
51(1)205,
52(3)307,
53(1)99,
53(1)z,
56(3)345,
57(1)3,
57(2)205,
58(0)3,
58(1)57,
58(1)143,
58(1)183,
59(1)115,
59(3)211,
59(3)259,
60(2)109,
60(3)297,
61(2)103,
61(2)175,
61(2)279,
62(0)3,
62(1)3,
62(3)251,
63(2)113,
63(3)303,
66(0)117,
66(2)181,
67(1)87,
68(1)37,
68(1)57
- testing,
35(1)109,
37(2)151,
38(2)323,
41(1)81,
44(1)69,
46(2)175,
47(3)277,
50(3)241,
50(3)285,
53(2)225,
61(2)225,
64(2)175,
66(2)157,
66(3)299,
66(3)333,
69(2)117
- time,
35(2)215,
36(2)203,
36(2)265,
37(1)1,
37(2)123,
38(2)157,
38(2)249,
38(2)269,
38(2)323,
40(1)31,
40(1)57,
40(1)67,
40(2)175,
40(2)195,
41(1)81,
41(2)141,
43(2)337,
46(2)219,
46(2)261,
47(1)39,
47(1)85,
47(3)315,
47(3)329,
48(1)9,
48(1)35,
48(2)273,
49(1)81,
50(2)183,
51(1)177,
51(1)221,
51(1)239,
52(3)177,
52(3)269,
53(2)201,
54(1)53,
54(1)65,
54(1)129,
54(2)181,
54(2)199,
54(2)249,
54(2)315,
56(1)3,
57(2)317,
57(2)327,
58(1)57,
58(1)69,
58(1)155,
58(1)175,
58(1)249,
58(1)325,
59(1)115,
60(3)255,
60(3)341,
61(2)175,
62(1)105,
63(1)43,
63(3)295,
68(1)57,
68(3)319,
69(2)117
- upper,
41(2)247,
46(2)107,
47(2)149,
49(2)217,
58(1)263,
60(3)285,
61(2)149,
66(1)1,
67(1)55
- worst-case,
58(1)325,
62(3)251,
66(1)105,
68(1)57