Entry Raiha:1981:SCS 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{Raiha:1981:SCS,
author = "K.-J. Raiha and E. Ukkonen",
title = "The shortest common supersequence problem over binary
alphabet is {NP-complete}",
journal = j-THEOR-COMP-SCI,
volume = "16",
number = "2",
pages = "187--198",
month = nov,
year = "1981",
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 = "C1180 (Optimisation techniques); C4210 (Formal
logic); C4220 (Automata theory)",
corpsource = "Dept. of Computer Sci., Univ. of Helsinki, Helsinki,
Finland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "automata theory; binary alphabet; finite strings;
formal languages; NP-complete; optimisation; shortest
common supersequence problem",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- alphabet,
10(1)19,
13(3)331,
14(1)63,
14(1)119,
18(2)221,
19(3)231,
22(3)297,
22(3)331,
23(1)69,
23(1)83,
33(2)305,
33(2)327,
34(1)135
- binary,
10(1)63,
11(2)123,
14(1)79,
19(3)337,
22(3)253,
22(3)331,
23(3)333,
27(3)255,
29(1)49,
31(1)125,
32(1)121,
32(3)227,
33(2)327
- C1180,
10(2)123,
11(1)1,
12(1)83,
14(3)289,
15(1)27,
15(3)251,
15(3)279,
19(1)1,
19(2)189,
19(3)337,
21(1)99,
21(3)255
- C4220,
10(1)19,
10(3)221,
10(3)249,
10(3)273,
11(2)167,
12(2)161,
12(3)333,
13(2)231,
13(3)295,
13(3)315,
13(3)323,
13(3)331,
14(1)39,
14(1)63,
14(1)91,
14(2)155,
14(3)211,
15(2)117,
15(3)311,
16(1)75,
16(2)115,
16(2)223,
17(1)99,
17(2)229,
17(3)333,
18(1)33,
18(2)207,
19(2)161,
19(2)219,
19(3)253,
19(3)305,
19(3)331,
21(1)27,
21(1)39,
21(2)145,
21(3)237,
21(3)255,
22(1)57,
22(1)219,
22(3)297,
23(1)37,
23(1)95,
23(1)103,
23(2)155,
23(2)217,
23(3)231,
23(3)287,
23(3)305,
23(3)333,
24(1)95,
24(1)105,
24(2)123,
24(2)179,
24(3)313,
24(3)331,
25(2)193,
25(3)221,
25(3)311,
26(1)1,
26(1)25,
26(1)197,
26(1)221,
26(1)225,
26(3)327,
26(3)343,
27(1)61,
27(1)121,
27(1)217,
28(1)1,
28(1)223,
28(3)263,
28(3)277,
28(3)315,
28(3)329,
29(1)87,
29(1)123,
30(2)205,
31(3)297,
31(3)317,
32(1)87,
32(1)201,
32(1)221,
32(3)227,
32(3)309,
32(3)321,
32(3)331,
32(3)339,
33(1)3,
33(2)261,
33(2)335,
34(1)157,
34(3)241,
34(3)255
- common,
14(3)317,
15(1)77,
19(3)231,
23(1)83,
32(1)1,
32(1)157
- complete, NP-,
13(3)295,
19(1)1,
19(1)17,
31(1)125,
12(1)83
- finite,
10(1)19,
10(2)187,
10(3)273,
11(2)167,
13(2)137,
13(3)323,
13(3)331,
14(1)19,
14(1)39,
14(1)63,
14(2)195,
14(3)227,
15(2)201,
16(2)223,
17(1)99,
17(3)333,
18(3)325,
19(3)231,
19(3)305,
20(2)95,
21(1)91,
21(2)225,
21(3)357,
22(1)19,
22(1)95,
22(3)285,
22(3)297,
23(1)83,
23(1)95,
23(2)155,
23(2)217,
23(3)339,
24(2)179,
24(3)331,
27(1)121,
27(1)217,
28(3)277,
28(3)287,
28(3)315,
28(3)329,
29(1)87,
29(1)185,
31(1)139,
31(3)297,
32(1)173,
32(1)201,
32(3)249,
32(3)321,
33(2)239,
33(2)261,
33(2)335,
34(1)135
- NP-complete,
12(1)83,
13(3)295,
19(1)1,
19(1)17,
31(1)125
- optimisation,
10(2)123,
11(1)1,
12(1)83,
14(1)79,
14(1)103,
14(3)289,
15(1)27,
15(3)251,
15(3)279,
19(1)1,
19(2)189,
19(3)337,
21(1)99,
21(3)255
- shortest,
32(1)61
- string,
14(2)127,
17(3)333,
21(3)357,
22(3)297,
23(1)69,
23(1)83,
23(3)287,
24(2)179,
26(3)301,
31(1)211,
31(3)227
- technique,
10(2)123,
11(1)1,
11(2)145,
12(1)83,
12(3)325,
13(1)61,
13(1)109,
14(1)19,
14(3)289,
15(1)27,
15(3)251,
15(3)279,
19(1)1,
19(2)189,
19(3)321,
19(3)337,
21(1)99,
21(3)255,
22(1)19,
24(1)1,
31(1)13,
32(1)77,
33(1)117,
33(1)z