Entry Middendorf:1993:SCN 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{Middendorf:1993:SCN,
author = "M. Middendorf",
title = "The shortest common nonsubsequence problem is
{NP-complete}",
journal = j-THEOR-COMP-SCI,
volume = "108",
number = "2",
pages = "365--369",
day = "15",
month = feb,
year = "1993",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:16:58 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1993&volume=108&issue=2;
http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1993&volume=108&issue=2&aid=1232",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4240 (Programming and algorithm theory)",
corpsource = "Inst. fur Angewandte Inf. und Formale Sprachen,
Karlsruhe, Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "alphabet; computational complexity; finite set; formal
languages; NP-complete; set theory; shortest common
nonsubsequence problem",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- alphabet,
71(3)381,
73(1)81,
73(3)279,
73(3)335,
76(2)261,
79(1)195,
81(1)147,
81(2)289,
83(2)287,
88(1)117,
92(1)33,
92(1)77,
92(1)87,
92(1)145,
95(2)187,
108(2)311,
108(2)345,
113(1)35,
115(2)243,
115(2)359,
118(1)49,
123(1)61,
127(1)53,
131(2)311,
132(1)71,
132(1)415,
134(1)87,
134(1)209,
134(1)225,
134(2)329
- common,
78(2)363,
83(2)287,
87(1)43,
88(1)59,
92(1)3,
92(1)191,
92(1)z,
108(2)345,
125(1)91,
125(2)205,
130(1)203
- complete, NP-,
80(2)203,
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,
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
- NP-complete,
80(2)203,
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,
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
- shortest,
79(1)151,
82(1)35,
84(1)127,
92(1)3,
108(2)251,
112(2)215,
116(2)359,
125(2)205,
125(2)229,
134(2)473