Entry Long:1982:SNP 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{Long:1982:SNP,
author = "T. J. Long",
title = "Strong nondeterministic polynomial-time
reducibilities",
journal = j-THEOR-COMP-SCI,
volume = "21",
number = "1",
pages = "1--25",
month = oct,
year = "1982",
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 = "C4240 (Programming and algorithm theory)",
corpsource = "Dept. of Computer and Information Sci., Ohio State
Univ., Columbus, OH, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Adleman and Manders; computational complexity;
deterministic polynomial-time reducibilities; Ladner,
Lynch and Selman; NP-hard sets; recursive sets; strong
nondeterministic polynomial-time reducibilities",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- 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)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(1)3,
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
- deterministic,
10(3)317,
11(2)181,
11(3)227,
12(1)61,
12(3)333,
13(3)295,
13(3)323,
14(1)91,
14(2)155,
15(2)181,
15(3)251,
16(1)75,
16(2)149,
17(2)229,
18(1)1,
18(1)69,
19(2)219,
21(1)27,
21(1)39,
21(1)105,
21(2)145,
21(2)213,
22(1)57,
23(1)37,
23(2)107,
23(2)129,
23(2)211,
23(3)287,
24(2)123,
24(3)313,
25(1)1,
26(1)1,
26(1)221,
26(1)225,
27(1)127,
27(1)197,
28(1)111,
28(1)223,
30(2)205,
31(3)317,
32(1)61,
32(1)87,
32(1)121,
32(3)331,
33(1)3,
33(1)z,
33(2)139,
33(2)335,
34(1)17,
34(3)255
- hard, NP-,
17(1)55,
31(1)125
- Long, T. J.,
14(1)91
- nondeterministic,
10(1)19,
11(2)181,
11(3)227,
13(2)175,
13(2)193,
13(3)239,
14(1)91,
15(1)27,
15(2)181,
15(3)251,
18(3)301,
20(3)323,
23(1)37,
23(1)95,
23(2)187,
23(3)287,
24(1)105,
24(3)313,
26(3)327,
26(3)343,
28(1)83,
29(1)27,
32(1)121,
32(3)227,
32(3)321,
32(3)331,
33(1)65,
34(1)135,
34(1)227
- NP-hard,
17(1)55,
31(1)125
- polynomial-time,
12(2)161,
19(1)1,
32(3)249,
34(1)207,
34(3)255
- recursive,
11(2)181,
12(2)175,
13(2)193,
13(3)239,
15(2)159,
17(2)163,
17(3)235,
20(2)95,
20(3)323,
22(1)135,
22(3)233,
23(3)305,
23(3)333,
25(1)1,
25(2)193,
26(1)105,
26(1)131,
27(1)225,
28(1)111,
29(1)49,
29(1)185,
30(2)139,
31(1)41,
31(1)101,
32(1)173,
33(2)261
- reducibility,
14(1)91,
19(3)287,
26(3)287,
31(1)49,
31(1)101,
32(1)61,
32(3)279
- set,
10(1)19,
12(2)161,
12(3)325,
13(2)137,
13(3)295,
14(3)317,
14(3)337,
15(1)27,
15(2)181,
16(2)231,
17(1)75,
17(2)151,
18(1)95,
18(3)325,
19(1)29,
19(1)39,
19(3)287,
21(1)91,
21(3)315,
22(1)19,
22(3)253,
23(1)83,
23(3)333,
24(1)105,
24(3)279,
26(3)243,
28(3)315,
29(1)185,
31(1)1,
31(3)337,
32(1)25,
32(1)61,
32(1)173,
32(3)279,
33(2)239,
34(1)17,
34(1)227,
34(3)275,
34(3)337,
34(3)343
- strong,
24(1)21,
27(1)3
- time, polynomial-,
12(2)161,
19(1)1,
32(3)249,
34(1)207,
34(3)255