Entry Du:1989:ISC 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{Du:1989:ISC,
author = "Ding-Zhu Du and Ronald V. Book",
title = "On inefficient special cases of {NP}-complete
problems",
journal = j-THEOR-COMP-SCI,
volume = "63",
number = "3",
pages = "239--252",
month = mar,
year = "1989",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
affiliation = "Acad Sinica",
affiliationaddress = "Beijing, China",
classification = "723; 921; C4240 (Programming and algorithm theory)",
corpsource = "Inst. of Appl. Math., Acad. Sinica., Beijing, China",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
journalabr = "Theor Comput Sci",
keywords = "computability; computational complexity; Computer
Metatheory; inefficient special cases; intractable set;
Intractable Sets; Mathematical Techniques--Set Theory;
np Complete Problems; NP-complete problems; polynomial
complexity core",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- Book, Ronald V.,
61(2)103
- case,
52(3)307,
53(2)243,
58(1)325,
62(3)251,
64(1)119,
67(1)87,
68(1)57
- 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,
56(2)211,
57(2)317,
58(1)129,
63(1)43,
64(1)125,
65(3)343,
67(2)203,
67(2)303,
68(1)37,
68(3)267
- complete, NP-,
36(2)173,
38(2)323,
39(2)207,
40(1)57,
40(2)323,
41(2)141,
44(3)247,
46(2)219,
47(1)85,
51(1)221,
54(2)181,
58(1)209,
52(1)145,
58(1)209
- complete, NP-,
36(2)173,
38(2)323,
39(2)207,
40(1)57,
40(2)323,
41(2)141,
44(3)247,
46(2)219,
47(1)85,
51(1)221,
54(2)181,
58(1)209,
52(1)145,
58(1)209
- computability,
38(1)17,
38(1)35,
42(2)123,
43(2)251,
46(2)197,
47(3)263,
47(3)299,
51(3)255,
51(3)265,
66(2)117,
67(1)87,
68(3)267
- core,
47(2)121,
61(2)103
- Du, Ding-Zhu,
61(2)103
- intractable,
35(2)313
- mathematical,
36(2)145,
45(1)1,
57(0)3,
57(1)131,
57(1)147,
57(1)153,
58(0)3,
58(1)17,
58(1)103,
58(1)143,
58(1)183,
58(1)201,
58(1)209,
58(1)263,
58(1)325,
58(1)361,
58(1)379,
59(3)277,
59(3)297,
60(1)1,
60(3)297,
61(2)121,
61(2)175,
61(2)225,
61(2)289,
61(2)299,
61(2)307,
62(1)221,
62(3)235,
62(3)251,
63(1)43,
63(1)63,
63(2)223,
63(3)253,
63(3)275,
63(3)295,
64(1)1,
64(1)15,
64(1)83,
64(1)107,
64(1)125,
64(2)135,
64(2)159,
65(0)123,
65(2)123,
65(2)131,
65(2)143,
65(2)149,
65(2)153,
65(2)189,
65(2)197,
65(2)213,
65(2)221,
65(2)243,
65(2)249,
65(2)265,
66(0)117,
66(2)137,
66(2)157,
66(2)181,
66(2)205,
67(1)5,
67(1)37,
67(1)55,
67(1)111,
67(1)115
- Metatheory,
57(0)3,
58(0)3,
58(1)129,
58(1)209,
59(0)3,
59(1)25,
59(1)85,
59(1)115,
59(1)181,
59(3)211,
59(3)235,
59(3)287,
59(3)317,
60(3)231,
60(3)255,
60(3)297,
61(2)103,
61(2)199,
62(3)289,
62(3)311,
62(3)319,
63(1)1,
63(1)19,
63(1)43,
63(1)91,
63(2)113,
63(2)203,
63(3)253,
63(3)275,
63(3)303,
63(3)333,
64(1)1,
64(1)15,
64(1)25,
64(1)55,
64(1)67,
64(1)97,
64(1)119,
64(3)221,
64(3)271,
64(3)281,
64(3)305,
64(3)331,
64(3)343,
65(0)123,
65(1)1,
65(1)35,
65(1)85,
65(2)123,
65(2)131,
65(2)143,
65(2)149,
65(2)153,
65(2)189,
65(2)197,
65(2)213,
65(2)243,
65(2)249,
65(2)265,
65(3)271,
65(3)291,
65(3)343,
66(0)117,
66(2)205,
67(1)19,
67(1)87
- np,
58(1)129,
63(1)43
- NP-complete,
36(2)173,
38(2)323,
39(2)207,
40(1)57,
40(2)323,
41(2)141,
44(3)247,
46(2)219,
47(1)85,
51(1)221,
52(1)145,
54(2)181,
58(1)209
- Set, Techniques-,
60(3)297,
61(2)307,
62(1)221,
62(3)235,
63(1)43,
63(1)63
- special,
39(2)123,
44(3)259,
49(1)13,
52(1)77,
63(3)333
- Techniques--Set,
60(3)297,
61(2)307,
62(1)221,
62(3)235,
63(1)43,
63(1)63